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

We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists…

In this paper, we systematically summarize and enhance the understanding of weak convergence and functional limits of record numbers in discrete-time random walks under Spitzer's condition, and extend these findings to $\sigma$--record…

Let $\beta > 1$ and the run-length function $r_n(x,\beta)$ be the maximal length of consecutive zeros amongst the first n digits in the $\beta$-expansion of $x\in[0,1]$. The exceptional set $$E_{\max}^{\varphi}=\left\{x \in…

Finding the length of the longest increasing subsequence (LIS) is a classic algorithmic problem. Let $n$ denote the size of the array. Simple $O(n\log n)$ algorithms are known for this problem. We develop a polylogarithmic time randomized…

In this paper, we discuss the laws of the iterated logarithm (LIL) for occupation times of Markov processes $Y$ in general metric measure space both near zero and near infinity under some minimal assumptions. We first establish LILs of…

We give a general method of deriving statistical limit theorems, such as the central limit theorem and its functional version, in the setting of ergodic measure preserving transformations. This method is applicable in situations where the…

Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension, and also in higher dimensions if the map happens to be Markov. In general, the nonconformality of multidimensional intermittent maps represents a challenge that…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

For two independent Erd\H{o}s-R\'enyi graphs $\mathbf G(n,p)$, we study the maximal overlap (i.e., the number of common edges) of these two graphs over all possible vertex correspondence. We present a polynomial-time algorithm which finds a…

We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time. The main motivation is to get more efficient algorithms for problems with unattractive polynomial running times. Here, we focus…

We propose an efficient algorithm for matching two correlated Erd\H{o}s--R\'enyi graphs with $n$ vertices whose edges are correlated through a latent vertex correspondence. When the edge density $q= n^{- \alpha+o(1)}$ for a constant $\alpha…

We study convexity properties of the zeros of some special functions that follow from the convexity theorem of Sturm. We prove results on the intervals of convexity for the zeros of Laguerre, Jacobi and ultraspherical polynomials, as well…

The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…

We establish a functional limit theorem for the joint-law of occupations near and away from indifferent fixed points of interval maps, and of waits for the occupations away from these points, in the sense of strong distributional…

We study the stopping time of the Collatz map for a polynomial $f \in \mathbb{F}_2[x]$, and bound it by $O({\rm deg} (f)^{1.5})$, improving upon the quadratic bound proven by Hicks, Mullen, Yucas and Zavislak. We also prove the existence…

We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aimed to compare the efficiency by describing the rate at which the…

We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…

The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of…

Recently, Byrnes presented a formula for the maximum length of a symmetric circuit code that has a long bit run and odd spread. Here we show that the formula is also valid when the spread is even. We also establish that all maximum length…

We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A…