Name
Abstract | ||
|---|---|---|
We study four problems: put n distinguishable/non-distinguishable balls into k non-empty distinguishable/non-distinguishable boxes randomly. What is the threshold function k=k(n) to make almost sure that no two boxes contain the same number of balls? The non-distinguishable ball problems are very close to the Erdős---Lehner asymptotic formula for the number of partitions of the integer n into k parts with k=o(n1/3). The problem is motivated by the statistics of an experiment, where we only can tell whether outcomes are identical or different. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-36899-8_22 | Information Theory, Combinatorics, and Search Theory |
Keywords | Field | DocType |
k non-empty distinguishable,non-distinguishable ball,revisiting erd,lehner asymptotic formula,integer n,non-distinguishable ball problem,k part,non-distinguishable box,distinct part,n distinguishable,threshold function k,random function | Integer,Discrete mathematics,Asymptotic formula,Combinatorics,Ball (bearing),Rank of a partition,Composition (combinatorics),Mathematics,Threshold function,Random function | Conference |
Citations | PageRank | References |
1 | 0.39 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eva Czabarka | 1 | 50 | 10.82 |
| Matteo Marsili | 2 | 149 | 17.65 |
| László A. Székely | 3 | 490 | 65.01 |