Related papers: Structure and asymptotics for Motzkin numbers modu…
In this note, we answer a question of Mirzakhani on asymptotic behavior of the one-point volume polynomial of moduli spaces of curves. We also present some applications of Mirzakhani's asymptotic formulae of Weil-Petersson volumes.
We prove relative asymptotic for the ratio of two sequences of multiple orthogonal polynomials with respect to Nikishin system of measures. The first Nikishin system ${\mathcal{N}}(\sigma_1,...,\sigma_m)$ is such that for each $k$,…
We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…
In this paper we propose an approach for measuring growth of complexity of emerging patterns in complex systems such as cellular automata. We discuss several ways how a metric for measuring the complexity growth can be defined. This…
We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of…
In the coupon collector problem with $n$ items, the collector needs a random number of tries $T_n\simeq n\ln n$ to complete the collection. Also, after $nt$ tries, the collector has secured approximately a fraction…
Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
We study the homological properties of random simplicial complexes. In particular, we obtain the asymptotic behavior of lifetime sums for a class of increasing random simplicial complexes; this result is a higher-dimensional counterpart of…
A general primal-dual splitting algorithm for solving systems of structured coupled monotone inclusions in Hilbert spaces is introduced and its asymptotic behavior is analyzed. Each inclusion in the primal system features compositions with…
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of…
In a previous work, the authors resolved a conjecture about the structure of prime-detecting quasi-modular forms by studying sign changes occurring in quasi-modular cusp forms. In this paper, we extend the considerations to prime-detecting…
We give a result on the asymptotic behavior of the Hurwitz-Lerch multiple zeta functions near non-positive integer points by using the Apostol-Bernoulli polynomials. From this result, we can evaluate limit values at non-positive integer…
We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…
Various types of local zeta functions studied in asymptotic group theory admit two natural operations: (1) change the prime and (2) perform local base extensions. Often, the effects of both of these operations can be expressed…
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…