Related papers: The impatient collector
We study in this paper a generalized coupon collector problem, which consists in analyzing the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We…
This work has two main purposes. On the one side we investigate in this work a question of H. Esnault on congruence formula in a construction of H. Esnault and C. Xu for the number of rational points on the closed fiber of a singular model…
We try to define the sequence of zeros of the Riemann zeta function by an intrinsic property. Let $(z_k)_{k\in \mathbb{N}}$ be the sequence of nontrivial zeros of $\zeta(s)$ with positive imaginary part. We write $z_k= 1/2+i\tau_k$ (RH says…
We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity…
Recurrence quantification analysis is a method for measuring the complexity of dynamical systems. Recurrence determinism is a fundamental characteristic of it, closely related to correlation sum. In this paper, we study asymptotic behavior…
This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same…
In this note we evaluate the expectation and variance of the waiting time to complete $m$ parallel collections of coupons, in the case of coupons which arrives independently, one by one and with equal probabilities.
We prove an asymptotic for the sum of $\zeta^{(n)} (\rho)X^{\rho}$ where $\zeta^{(n)} (s)$ denotes the $n$th derivative of the Riemann zeta function, $X$ is a positive real and $\rho$ denotes a non-trivial zero of the Riemann zeta function.…
The Coupon Collector Problem (CCP) is a well-known combinatorial problem that seeks to estimate the number of random draws required to complete a collection of $n$ distinct coupon types. Various generalizations of this problem have been…
In this paper we investigate the computational complexity of motivating time-inconsistent agents to complete long term projects. We resort to an elegant graph-theoretic model, introduced by Kleinberg and Oren, which consists of a task graph…
In this paper, we study the complexity of the approximation of nonadmissible curves for nonlinear control-affine systems satisfying the strong H{\"o}rmander condition. Focusing on tubular approximation complexities, we provide asymptotic…
We solve an asymptotic problem in the geometry of numbers, where we count the number of singular $n\times n$ matrices where row vectors are primitive and of length at most T. Without the constraint of primitivity, the problem was solved by…
The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite.…
In the perfect conductivity problem of composites, the electric field may become arbitrarily large as $\varepsilon$, the distance between the inclusions and the matrix boundary, tends to zero. The main contribution of this paper lies in…
We provide explicit ranges for $\sigma$ for which the asymptotic formula \begin{equation*} \int_0^T|\zeta(1/2+it)|^4|\zeta(\sigma+it)|^{2j}dt \;\sim\; T\sum_{k=0}^4a_{k,j}(\sigma)\log^k T \quad(j\in\mathbb N) \end{equation*} holds as…
An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno. Over the years important…
It is known that, if a point in $R^n$ is driven by a bounded below potential $V$, whose gradient is always in a closed convex cone which contains no lines, then the velocity has a finite limit as time goes to $+\infty$. The components of…
We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We develop an asymptotic approximation and bounds for the traveling salesman problem with time slots, i.e. when the time windows of points to visit are a partition of a given time horizon. Although this problem is relevant in several…