Related papers: The impatient collector
When are asymptotic approximations using the delta-method uniformly valid? We provide sufficient conditions as well as closely related necessary conditions for uniform negligibility of the remainder of such approximations. These conditions…
We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic…
We study three nonmonotone coupon-collector models through a stationary-entry viewpoint. In such models the all-present state is not absorbing, so completion is governed not by the disappearance of a monotone terminal cloud but by rare new…
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete. Using an automata-based…
We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…
The function $\inf_n nx^{1/n}$ has the asymptotics $eu+e d^2(u)/(2u)+O(1/u^2)$ as $x\to\infty$, where $u=\log x$ and $d(u)$ is the distance from $u$ to the nearest integer. We generalize this observation. First, the curves $y=nx^{1/n}$ can…
The main theme of this paper is to study for a symplectomorphism of a compact surface, the asymptotic invariant which is defined to be the growth rate of the sequence of the total dimensions of symplectic Floer homologies of the iterates of…
In this paper the coupon collector's problem with group drawings is studied. Assume there are $ n $ different coupons. At each time precisely $ s $ of the $ n $ coupons are drawn, where all choices are supposed to have equal probability.…
The Pitman sampling formula has been intensively studied as a distribution of random partitions. One of the objects of interest is the length $K (= K_{n,\theta,\alpha})$ of a random partition that follows the Pitman sampling formula, where…
We consider a generalisation of the classical coupon collector problem. We define a super-coupon to be any $s$-subset of a universe of $n$ coupons. In each round, a random $r$-subset from the universe is drawn and all its $s$-subsets are…
We address the problems in applying cycle expansions to bound chaotic systems, caused by e.g. intermittency and incompleteness of the symbolic dynamics. We discuss zeta functions associated with weighted evolution operators and in…
In [Temme N.M., Special functions. An introduction to the classical functions of mathematical physics, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1996, Section 11.3.3.1] a uniform asymptotic expansion for the…
We study asymptotics of three point coefficients (light-light-heavy) and two point correlators in heavy states in unitary, compact $2$D CFTs. We prove an upper and lower bound on such quantities using numerically assisted Tauberian…
This paper focuses on the estimation of the concentration curve of a finite population, when data are collected according to a complex sampling design with different inclusion probabilities. A (design-based) Hajek type estimator for the…
We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…
We study local (the heat equation) and nonlocal (convolution type problems with an integrable kernel) evolution problems on a metric connected finite graph in which some of the edges have infinity length. We show that the asymptotic…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
We consider zeta functions: $Z(f ;P ;s)=\sum_{\m \in \N^{n}} f(m_1,..., m_n) P(m_1,..., m_n)^{-s/d}$ where $P \in \R [X_1,..., X_n]$ has degree $d$ and $f$ is a function arithmetic in origin, e.g. a multiplicative function. In this paper, I…
We generalize the well-known Coupon Collector Problem (CCP) in combinatorics. Our problem is to find the minimum and expected number of draws, with replacement, required to recover $n$ distinctly labeled coupons, with each draw consisting…
We provide a sharp estimate for the asymptotic number of lattice zonotopes, inscribed in $[0,n ]^d$ when $n$ tends to infinity. Our estimate refines the logarithmic equivalent established by Barany, Bureaux, and Lund when the sum of the…