Related papers: A note on the run length function for intermittenc…

We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…

We prove that the entropy function on the moduli space of real quadratic rational maps is not monotonic by exhibiting a continuum of disconnected level sets. This entropy behavior is in stark contrast with the case of polynomial maps, and…

We investigate quantitative recurrence in systems having an infinite measure. We extend the Ornstein-Weiss theorem for a general class of infinite systems estimating return time in decreasing sequences of cylinders. Then we restrict to a…

We consider the almost sure asymptotic behavior of the periodogram of stationary and ergodic sequences. Under mild conditions we establish that the limsup of the periodogram properly normalized identifies almost surely the spectral density…

The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

We study the Dirichlet series associated with the integers whose radix-$b$ representation misses certain (fixed) digits. The existence of a meromorphic continuation to the entire complex plane, which was already well-known as a general fact…

We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…

We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…

We provide a numerical method to determine the critical lengths of linear differential operators with constant real coefficients. The need for such a procedure arises when the orders increase. The interest of this article is clearly on the…

Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $n$ be a positive integer. In this paper, we study the digraph associated to the map $x\mapsto x^n h(x^{\frac{q-1}{m}})$, where $h(x)\in\mathbb{F}_q[x].$ We completely determine…

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…

The idea of enumeration algorithms with polynomial delay is to polynomially bound the running time between any two subsequent solutions output by the enumeration algorithm. While it is open for more than four decades if all minimal…

Kaprekar's routine, i.e., sorting the digits of an integer in ascending and descending order and subtracting the two, defines a finite deterministic map on the state space of fixed-length digit strings. While its attractors (such as 495 for…

Linear rank-width is a linearized variation of rank-width, and it is deeply related to matroid path-width. In this paper, we show that the linear rank-width of every $n$-vertex distance-hereditary graph, equivalently a graph of rank-width…

On the space of rhythms of arbitrary length with a fixed number of onsets, a self map $F$ is constructed. It is shown that for any rhythm $\mathbf{r}$ of the space there exists a nonnegative integer $k$ such that $F^k(\mathbf{r})$ falls…

We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the 9 finite graphs from the classical result of Beineke together with a 10th infinite graph associated to the equivalence relation $\mathbb{E}_0$ on the…

We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. The six-length of a vertex $v\in V$ is defined from the…

Given a string of parentheses, the task is to find the longest consecutive segment that is balanced, in linear time. We find this problem interesting because it involves a combination of techniques: the usual approach for solving segment…

We establish the asymptotic zero distribution for polynomials generated by a four-term recurrence relation with varying recurrence coefficients having a particular limiting behavior. The proof is based on ratio asymptotics for these…