arXiv subjects

M. Rigo

Publications and source records attributed to M. Rigo.

9 recordsLinked to original sources

arXiv2024

Computing the k-binomial complexity of generalized Thue--Morse words

Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an infinite word is a function that maps the integer $n\geq 0$ to the number of k-binomial equivalence classes represented by its factors of length n. The Thue--Morse (TM) word and its generalization to larger alphabets are ubiquitous in mathematics due to their rich combinatorial properties. This work addresses the k-binomial complexities of generalized TM words. Prior research by Lejeune, Leroy, and Rigo determined the k-binomial complexities of the 2-letter TM word. For larger alphabets, work by L\"u, Chen, Wen, and Wu determined the 2-binomial complexity for m-letter TM words, for arbitrary m, but the exact behavior for $k\geq 3$ remained unresolved. They conjectured that the k-binomial complexity function of the m-letter TM word is eventually periodic with period $m^k$. We resolve the conjecture positively by deriving explicit formulae for the k-binomial complexity functions for any generalized TM word. We do this by characterizing k-binomial equivalence among factors of generalized TM words. This comprehensive analysis not only solves the open conjecture, but also develops tools such as abelian Rauzy graphs.

math.CO↗

arXiv2020

Ultimate periodicity problem for linear numeration systems

We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is ultimately periodic. We prove that this problem is decidable for a large class of numeration systems built on linearly recurrent sequences. Based on arithmetical considerations about the recurrence equation and on $p$-adic methods, the DFA given as input provides a bound on the admissible periods to test.

cs.DM↗

arXiv2013

Avoiding 2-binomial squares and cubes

Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the number of occurrences of $x$ in $v$. This notion is a refinement of the usual abelian equivalence. A 2-binomial square is a word $uv$ where $u$ and $v$ are 2-binomially equivalent. In this paper, considering pure morphic words, we prove that 2-binomial squares (resp. cubes) are avoidable over a 3-letter (resp. 2-letter) alphabet. The sizes of the alphabets are optimal.

cs.FL↗

arXiv2009

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not $X$ is a finite union of arithmetic progressions. We obtain a decision procedure for this problem, under some hypothesis about the considered numeration system. In a second part, we obtain an analogous decision result for a particular class of abstract numeration systems built on an infinite regular language.

cs.FL↗

arXiv2009

A note on syndeticity, recognizable sets and Cobham's theorem

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is needed in the classical proof of the celebrated Cobham?s theorem. Therefore the aim of this paper is to complete [13] and [1] to obtain an accessible proof of Cobham?s theorem.

cs.FL↗

arXiv2002

Real numbers having ultimately periodic representations in abstract numeration systems

Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to characterize the numbers having an ultimately periodic representation in generalized systems built on a regular language. The syntactical properties of these words are also investigated. Finally, we show the equivalence of the classical "theta"-expansions with our generalized representations in some special case related to a Pisot number "theta".

cs.CC↗

arXiv1997

Continuous stochastic Schrodinger equations and localization

The set of continuous norm-preserving stochastic Schrodinger equations associated with the Lindblad master equation is introduced. This set is used to describe the localization properties of the state vector toward eigenstates of the environment operator. Particular focus is placed on determining the stochastic equation which exhibits the highest rate of localization for wide open systems. An equation having such a property is proposed in the case of a single non-hermitian environment operator. This result is relevant to numerical simulations of quantum trajectories where localization properties are used to reduce the number of basis states needed to represent the system state, and thereby increase the speed of calculation.

quant-ph↗

arXiv1996

The Quantum state diffusion model and the driven damped nonlinear oscillator

We consider a driven damped anharmonic oscillator which classically leads to a bistable steady state and to hysteresis. The quantum counterpart for this system has an exact analytical solution in the steady state which does not display any bistability or hysteresis. We use quantum state diffusion theory to describe this system and to provide a new perspective on the lack of hysteresis in the quantum regime so as to study in detail the quantum to classical transition. The analysis is also relevant to measurements of a single periodically driven electron in a Penning trap where hysteresis has been observed.

quant-ph↗

arXiv1996

From quantum trajectories to classical orbits

Recently it has been shown that the evolution of open quantum systems may be ``unraveled'' into individual ``trajectories,'' providing powerful numerical and conceptual tools. In this letter we use quantum trajectories to study mesoscopic systems and their classical limit. We show that in this limit, Quantum Jump (QJ) trajectories approach a diffusive limit very similar to the Quantum State Diffusion (QSD) unraveling. The latter follows classical trajectories in the classical limit. Hence, both unravelings show the rise of classical orbits. This is true for both regular and chaotic systems (which exhibit strange attractors).

quant-ph↗