Related papers: Constrained exchangeable partitions

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.

We derive asymptotic formulas for the number of integer partitions with given sums of $j$th powers of the parts for $j$ belonging to a finite, non-empty set $J \subset \mathbb N$. The method we use is based on the `principle of maximum…

Partially exchangeable sequences representable as mixtures of Markov chains are completely specified by de Finetti's mixing measure. The paper characterizes, in terms of a subclass of hidden Markov models, the partially exchangeable…

This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…

This paper completes the classification of maximal unrefinable partitions, extending a previous work of Aragona et al. devoted only to the case of triangular numbers. We show that the number of maximal unrefinable partitions of an integer…

We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Leveraging a recently proposed notion of relative entropy in general probabilistic theories (GPT), we prove a finite de Finetti representation theorem for general convex bodies. We apply this result to address a fundamental question in…

A sequence of random variables is called exchangeable if the joint distribution of the sequence is unchanged by any permutation of the indices. De Finetti's theorem characterizes all $\{0,1\}$-valued exchangeable sequences as a "mixture" of…

We present a novel proof of de Finetti's Theorem characterizing permutation-invariant probability measures of infinite sequences of variables, so-called exchangeable measures. The proof is phrased in the language of Markov categories, which…

Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…

The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…

Variation of empirical Fr\'echet means on a metric space with curvature bounded above is encoded via random fields indexed by unit tangent vectors. A central limit theorem shows these random tangent fields converge to a Gaussian such field…

We consider a generic system composed of a fixed number of particles distributed over a finite number of energy levels. We make only general assumptions about system's properties and the entropy. System's constraints other than fixed number…

We obtain the analogue of the classical result by Erd\"os and Kac on the limiting distribution of the maximum of partial sums for exchangeable random variables with zero mean and variance one. We show that, if the conditions of the central…

De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only…

We explicitly compute limit shapes for several grand canonical Gibbs ensembles of partitions of integers. These ensembles appear in models of aggregation and are also related to invariant measures of zero range and coagulation-fragmentation…

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…