Related papers: A note on the run length function for intermittenc…
A theorem of Cohn and Lempel [J. Combin. Theory Ser. A 13 (1972), 83-89] gives an equality relating the number of circuits in a directed circuit partition of a 2-in, 2-out digraph to the GF(2)-nullity of an associated matrix. This equality…
An even (respectively, odd) hole in a graph is an induced cycle with even (respectively, odd) length that is at least four. Bienstock [DM 1991 and 1992] proved that detecting an even (respectively, odd) hole containing a given vertex is…
Let $G$ be a graph and $A$ the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $\mathrm{per}(xI-A)$. In this paper some of the results from a numerical study of the permanental polynomials of graphs are presented.…
Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…
A hole in a graph G is an induced cycle of length at least four; an antihole is a hole in the complement of G. In 2005, Chudnovsky, Cornuejols, Liu, Seymour and Vuskovic showed that it is possible to test in polynomial time whether a graph…
In this paper we consider a dynamic version of the Erd\H{o}s-R\'{e}nyi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of…
We study the dynamical Borel-Cantelli lemma for recurrence sets in a measure preserving dynamical system $(X, \mu, T)$ with a compatible metric $d$. We prove that, under some regularity conditions, the $\mu$-measure of the following set \[…
The Bernoulli sieve is an infinite occupancy scheme obtained by allocating the points of a uniform $[0,1]$ sample over an infinite collection of intervals made up by successive positions of a multiplicative random walk independent of the…
In image detection, one problem is to test whether the set, though mostly consisting of uniformly scattered points, also contains a small fraction of points sampled from some (a priori unknown) curve, for example, a curve with…
We consider an irreducible finite range random walk on the $d$-dimensional integer lattice and study asymptotic behaviour of its transition function $p(n; x)$. In particular, for simple random walk our asymptotic formula is valid as long as…
We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…
We investigate the lengths and starting positions of the longest monochromatic arithmetic progressions for a fixed difference in the Fibonacci word. We provide a complete classification for their lengths in terms of a simple formula. Our…
We consider an interval map which is a generalization of the R\'enyi transformation. For the continued fraction expansion arising from this transformation, we prove a result concerning the asymptotic behavior of the distribution functions…
This paper presents a new anytime algorithm for the marginal MAP problem in graphical models. The algorithm is described in detail, its complexity and convergence rate are studied, and relations to previous theoretical results for the…
In this paper we mainly discuss sharp lower and upper bounds for the length of longest consecutive switches in IID Bernoulli sequences. This work is an extension of results in Erd\H{o}s and R\'{e}v\'{e}sz (1975) for longest head-run and Hao…
We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…
We show that for any sufficiently large $T,$ there exists a subinterval of $[T,2T]$ of length at least $2.766 \times \frac{2\pi}{\log{T}},$ in which the function $t \mapsto \zeta(1/2 + it)$ has no zeros.
We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…