Related papers: The Rosenberg-Strong Pairing Function
Earlier, Lunts and Rosenberg studied a notion of compatibility of endofunctors with localization functors, with an application to the study of differential operators on noncommutative rings and schemes. Another compatibility -- of Ore…
Based on fundamental measure theory, a Helmholtz free energy density functional for three-component mixtures of hard spheres with general, non-additive interaction distances is constructed. The functional constitutes a generalization of the…
Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…
The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…
In the latest version of the QMC model, QMC$\pi$-III-T, the density functional is improved to include the tensor component quadratic in the spin-current and a pairing interaction derived in the QMC framework. Traditional pairing strengths…
We discover an infinite number of recurrence relations among Regge string scattering amplitudes \cite{bosonic,RRsusy} of different string states at arbitrary mass levels in the open bosonic string theory. As a result, all Regge string…
Here, we give a complete description of the c-Boomerang Connectivity Table for the Gold function over finite fields of even characteristic, by using double Weil sums. In the process we generalize a result of Boura and Canteaut (IACR Trans.…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
Characterising intractable high-dimensional random variables is one of the fundamental challenges in stochastic computation. The recent surge of transport maps offers a mathematical foundation and new insights for tackling this challenge by…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…
We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.
Dualities are widely used in quantum field theories and string theory to obtain correlation functions at high accuracy. Here we present examples where dual data representations are useful in supervised classification, linking machine…
Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…
A ring with an Auslander dualizing complex is a generalization of an Auslander-Gorenstein ring. We show that many results which hold for Auslander-Gorenstein rings also hold in the more general setting. On the other hand we give criteria…
In software testing, the large size of the input domain makes exhaustively testing the inputs a daunting and often impossible task. Pair-wise testing is a popular approach to combinatorial testing problems. This paper reviews Pair-wise…
Ren et al. recently introduced a method for aggregating multiple decision trees into a strong predictor by interpreting a path taken by a sample down each tree as a binary vector and performing linear regression on top of these vectors…
We study the static correlation functions of the Richardson pairing model (also known as the reduced or discrete-state BCS model) in the canonical ensemble. Making use of the Algebraic Bethe Ansatz formalism, we obtain exact expressions…