RSA
2008
13 years 12 months ago
2008
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
RSA
2008
13 years 12 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
RSA
2008
13 years 12 months ago
2008
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
RSA
2008
13 years 12 months ago
2008
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
RSA
2008
13 years 12 months ago
2008
RSA
2008
13 years 12 months ago
2008
RSA
2008
13 years 12 months ago
2008
RSA
2008
13 years 12 months ago
2008
We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffl...
RSA
2008
13 years 12 months ago
2008
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
RSA
2008
13 years 12 months ago
2008