ASYMPTOTIC ENUMERATION AND LOGICAL LIMIT LAWS FOR EXPANSIVE MULTISETS AND SELECTIONS

DOI10.1112/S0024610705022477zbMATH Open1086.60006arXivmath/0407322MaRDI QIDQ3377413FDOQ3377413

Authors: Boris Granovsky, Dudley Stark 

Publication date: 22 March 2006

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Abstract: Given a sequence of integers $a_j,jge1,$ a multiset is a combinatorial object composed of unordered components, such that there are exactly $a_j$ one-component multisets of size $j.$ When $a_{j}asymp{j}^{r-1}{y}^j$ for some $r>0$, $ygeq1$, then the multiset is called {em expansive}. Let $c_n$ be the number of multisets of total size $n$. Using a probabilistic approach, we prove for expansive multisets that $c_n/c_{n+1}o1$ and that $c_n/c_{n+1}<1$ for large enough $n$. This allows us to prove Monadic Second Order Limit Laws for expansive multisets. The above results are extended to a class of expansive multisets with oscillation. Moreover, under the condition $a_j=K{j}^{r-1}{y}^j+O(y^{uj}),$ where $K>0$, $r>0$, $y>1$, $uin(0,1)$, we find an explicit asymptotic formula for $c_n$. In a similar way we study the asymptotic behavior of selections which are defined as multisets composed of components of distinct sizes.

Full work available at URL: https://arxiv.org/abs/math/0407322

Recommendations

• Total variation asymptotics for independent process approximations of logarithmic multisets and selections
• On multisets, interpolated multiple zeta values and limit laws
• The law of iterated logarithm for combinatorial multisets
• scientific article
• Asymptotics of decomposable combinatorial structures of alg-log type with positive log exponent

Mathematics Subject Classification ID

Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cited In (11)

• Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration
• A logical approach to asymptotic combinatorics I. First order properties
• The asymptotic number of weighted partitions with a given number of parts
• Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case
• Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof
• On the asymptotics of the element counting function in an additive arithmetic semigroup with exponential counting function of prime generators
• The law of iterated logarithm for combinatorial multisets
• Lévy Laplacians and instantons
• Asymptotic density in quasi-logarithmic additive number systems
• Remark on the inverse abstract prime number theorem
• Asymptotic enumeration and limit laws for multisets: the subexponential case

This page was built for publication: ASYMPTOTIC ENUMERATION AND LOGICAL LIMIT LAWS FOR EXPANSIVE MULTISETS AND SELECTIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377413)