Related papers: The impatient collector
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…
Asymptotic solutions are derived for inhomogeneous differential equations having a large real or complex parameter and a simple turning point. They involve Scorer functions and three slowly varying analytic coefficient functions. The…
Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. {\em Optimization} is one form of analysis. We argue that in many cases it may be better to replace the optimization…
In this article, we develop two types of asymptotic formulas for harmonic series in terms of single non-trivial zeros of the Riemann zeta function on the critical line. The series is obtained by evaluating the complex magnitude of an…
The infinite Brownian loop on a Riemannian manifold is the limit in distribution of the Brownian bridge of length $T$ around a fixed origin when $T \rightarrow +\infty$. The aim of this note is to study its long-time asymptotics on…
The leading asymptotic behaviour as $t\to \infty$ of the celebrated Riemann zeta function $\zeta(s), \ s = \sigma + it, \quad 0<\sigma<1, \quad t>0 , \ t\to\infty,$ can be expressed in terms of a transcendental sum. The sharp estimation of…
The set of all error--correcting block codes over a fixed alphabet with $q$ letters determines a recursively enumerable set of rational points in the unit square with coordinates $(R,\delta)$:= (relative transmission rate, relative minimal…
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant…
We consider the problem of filling an unknown area represented by an arbitrary connected graph of $n$ vertices by mobile luminous robots. In this problem, the robots enter the graph one-by-one through a specific vertex, called the Door, and…
To count bundles on curves, we study zetas of elliptic curves and their zeros. There are two types, i.e., the pure non-abelian zetas defined using moduli spaces of semi-stable bundles, and the group zetas defined for special linear groups.…
Mirzakhani obtained the asymptotic growth, when $L\to\infty$, of the number of curves in the mapping class group orbit of some given simple curve and with length at most $L$. Years later she extended this result from simple to arbitrary…
We continue the study of the compound renewal processes (c.r.p.), where the moment Cramer's condition holds (see [1]-[10], where the study of c.r.p. was started). In the paper arithmetic c.r.p. Z(n) are studied. In such processes random…
An {\it Omnibus Sequence} of length $n$ is one that has each possible "message" of length $k$ embedded in it as a subsequence. We study various properties of Omnibus Sequences in this paper, making connections, whenever possible, to the…
We review Yafaev's approach to asymptotic completeness for systems of particles mutually interacting with short-range potentials. The theory is based on computation of commutators with time-independent (mostly bounded) observables yielding…
By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity $\tau(n)$ of cyclic $n$-fold coverings of a graph. We give an explicit…
We study conditions under which integer sequences with independent, identically distributed gaps are asymptotically $k$-complete, meaning that every sufficiently large integer can be represented as the sum of exactly $k$ distinct elements…
We consider dynamical behavior of non-autonomous wave-type evolutionary equations with nonlinear damping, critical nonlinearity, and time-dependent external forcing which is translation bounded but not translation compact (i.e., external…
The solution of the classical Coupon Collector's Problem is based on the assumptions that all stickers are independently and uniformly distributed. We can prove statistically as well as analytically that in particular the assumption of…
We prove an asymptotic formula as $x\to +\infty$ for the number of algebraic integers $\alpha$ belonging to a fixed CM number field and satisfying $\alpha\overline{\alpha}\leq x$. This problem is related to the height zeta function…
We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed. The goal is to determine the expected number of group…