Related papers: Arnoux-Rauzy Subshifts: Linear Recurrence, Powers,…
The present paper is devoted to the study of resonances for one-dimensional quantum systems with a potential that is the restriction to some large box of an ergodic potential. For discrete models both on a half-line and on the whole line,…
We exhibit a family of sequences of noncommutative variables, recursively defined using monic palindromic polynomials in $\mathbb Q[x]$, and show that each possesses the Laurent phenomenon. This generalizes a conjecture by Kontsevich.
The renormalisation of NN scattering in theories with zero-range interactions is examined using a cut-off regularisation where the cut-off is taken to infinity, dimensional regularisation (DR) with minimal subtraction, and DR with…
The palindromization map $\psi$ in a free monoid $A^*$ was introduced in 1997 by the first author in the case of a binary alphabet $A$, and later extended by other authors to arbitrary alphabets. Acting on infinite words, $\psi$ generates…
This paper provides an upper bound for several subsets of maximal repeats and maximal pairs in compressed strings and also presents a formerly unknown relationship between maximal pairs and the run-length Burrows-Wheeler transform. This…
In 1882, Kronecker established that a given univariate formal Laurent series over a field can be expressed as a fraction of two univariate polynomials if and only if the coefficients of the series satisfy a linear recurrence relation. We…
We are interested in the random walk in random environment on an infinite tree. Lyons and Pemantle [11] give a precise recurrence/transience criterion. Our paper focuses on the almost sure asymptotic behaviours of a recurrent random walk…
A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational…
In the paper, some special linear combinations of the terms of rational cycles of generalized Collatz sequences are studied. It is proved that if the coefficients of the linear combinations satisfy some conditions then these linear…
Random contractions (sub-unitary random matrices) appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with discrete time. We analyze statistical properties of complex…
It has been recently discovered that some random processes may satisfy limit theorems even though they exhibit intermittency, namely an unusual growth of moments. In this paper we provide a deeper understanding of these intricate limiting…
The Landau-Lifshitz equation is the first in an infinite series of approximations to the Lorentz-Abraham-Dirac equation obtained from `reduction of order'. We show that this series is divergent, predicting wildly different dynamics at…
We conjecture that for a strongly minimal theory T in a finite signature satisfying the Zilber Trichotomy, there are only three possibilities for the recursive spectrum of T: all countable models of T are recursively presentable; none of…
We study the behavior of a polynomial sequence which is defined by iterating a polynomial pair under Thue-Morse dynamic. We show that in suitable sense, the sequence will behave like $\{2\cos 2^nx: n\ge 1\}$. Basing on this property we can…
Maximally supersymmetric gauge theories have experienced renewed interest due to the AdS/CFT correspondence and its conjectured S-duality. These gauge theories possess a large amount of symmetry and have quasi-integrable properties. We…
Our work addresses two important issues with recurrent neural networks: (1) they are over-parameterized, and (2) the recurrence matrix is ill-conditioned. The former increases the sample complexity of learning and the training time. The…
A gapped repeat (respectively, palindrome) occurring in a word $w$ is a factor $uvu$ (respectively, $u^Rvu$) of $w$. In such a repeat (palindrome) $u$ is called the arm of the repeat (respectively, palindrome), while $v$ is called the gap.…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…