Related papers: Sampling Part Sizes of Random Integer Partitions
For better learning, large datasets are often split into small batches and fed sequentially to the predictive model. In this paper, we study such batch decompositions from a probabilistic perspective. We assume that data points (possibly…
We compute the probability that a bipartite quantum state is separable by Monte Carlo sampling. This is carried out for rebits, qubits and quaterbits. We sampled $5\times 10^{11}$ points for each of these three cases. The results strongly…
A composition of an integer is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compsitions have been studied recently by Knopfmacher and Prodinger. We complement their work by establishing the…
We study random composite structures considered up to symmetry that are sampled according to weights on the inner and outer structures. This model may be viewed as an unlabelled version of Gibbs partitions and encompasses multisets of…
The problem of integer partitions is addressed using the microcanonical approach which is based on the analogy between this problem in the number theory and the calculation of microstates of a many-boson system. For ordinary…
Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of…
This work uses a simple quantum computer model to discuss the randomness of bit strings originated from integer sequences. The considered quantum computer model has three elements: a processing unit responsible for a mathematical operation,…
We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…
We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…
We propose an aproach for asymptotic analysis of plane partition statistics related to counts of parts whose sizes exceed a certain suitably chosen level. In our study, we use the concept of conjugate trace of a plane partition of the…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…
We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…
Randomness extraction is an essential post-processing step in practical quantum cryptography systems. When statistical fluctuations are taken into consideration, the requirement of large input data size could heavily penalise the speed and…
Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…
For a pair of random Gaussian integers chosen uniformly and independently from the set of Gaussian integers of norm $x$ or less as $x$ goes to infinity, we find asymptotics for the average norm of their greatest common divisor, with…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…
We state and prove a theorem on the partitioning of a randomly selected large population into stationary and non-stationary components by using a property of stationary population identity. Applications of this theorem for practical…