Mathematics – Combinatorics
Scientific paper
2004-07-19
Journal London Math. Soc. (2) 73 (2006) 252-272
Mathematics
Combinatorics
20 pages. This version contains a few minor corrections and changes.It will be published in J. of the London Math. Society
Scientific paper
Given a sequence of integers $a_j, j\ge 1,$ 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$, $y\geq 1$, 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}\to 1$ 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=Kj^{r-1}y^j + O(y^{\nu j}),$ where $K>0$, $r>0$, $y>1$, $\nu\in (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.
Granovsky Boris L.
Stark Dudley
No associations
LandOfFree
Asymptotic enumeration and logical limit laws for expansive multisets and selections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Asymptotic enumeration and logical limit laws for expansive multisets and selections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic enumeration and logical limit laws for expansive multisets and selections will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-535716