SearcharxivSearch

arXiv subjects

Savinien Kreczman

Publications and source records attributed to Savinien Kreczman.

6 recordsLinked to original sources

Parry condition, existence and uniqueness of alternate bases

Alternate bases are a numeration system that generalizes the R\'enyi numeration system. It is common in this context to construct examples or counter-examples by specifying the expansions of $1$ in the desired system. While it is easy to show when a system with given expansions of $1$ exists in the R\'enyi case, the same is not true in the alternate case. In this article, we establish conditions for given words to be the expansions of $1$ in the alternate case. To do so, we use a fixed point theorem on matrices defined from the expansions and obtain the elements of the base from the components of the fixed point. We also obtain a partial result for the uniqueness of such a base. In the latter parts of the article, we use similar techniques to prove the existence of bases with a given sequence of $B$-integers.

math.NT

Numeration systems without a dominant root and regularity

Positional numeration systems are a large family of numeration systems used to represent natural numbers. Whether the set of all representations forms a regular language or not is one of the most important questions that can be asked of such a system. This question was investigated in a 1998 article by Hollander. Central to his analysis is a property linking positional numeration systems and R\'{e}nyi numeration systems, which use a real base to represent real numbers. However, this link only exists when the initial numeration system has a dominant root, which is not a necessary condition for regularity. In this article, we show a more general link between positional numeration systems and alternate base numeration systems, a family generalizing R\'{e}nyi systems. We then take advantage of this link to provide a full characterization of those numeration systems that generate a regular language. We also discuss the effectiveness of our method, and comment Hollander's results and conjecture in the light of ours.

math.NT

On two conjectures of Shallit about Thue-Morse-like sequences

We study a class of infinite words $x_k$ , where $k$ is a positive integer, recently introduced by J. Shallit. This class includes the Thue-Morse sequence $x_1$, the Fibonacci-Thue-Morse sequence $x_2$, and the Allouche-Johnson sequence $x_3$. Shallit stated and for $k = 3$ proved two conjectures on properties of $x_k$. The first conjecture concerns the factor complexity, the second one the critical exponent of these words. We confirm the validity of both conjectures for every $k$.

math.CO

Positionality of Dumont--Thomas numeration systems for integers

Introduced in 2001 by Lecomte and Rigo, abstract numeration systems provide a way of expressing natural numbers with words from a language $L$ accepted by a finite automaton. As it turns out, these numeration systems are not necessarily positional, i.e., we cannot always find a sequence $U=(U_i)_{i\ge 0}$ of integers such that the value of every word in the language $L$ is determined by the position of its letters and the first few values of $U$. Finding the conditions under which an abstract numeration system is positional seems difficult in general. In this paper, we thus consider this question for a particular sub-family of abstract numeration systems called Dumont--Thomas numeration systems. They are derived from substitutions and were introduced in 1989 by Dumont and Thomas. We exhibit conditions on the underlying substitution so that the corresponding Dumont--Thomas numeration is positional. We first work in the most general setting, then particularize our results to some practical cases. Finally, we link our numeration systems to existing literature, notably properties studied by R\'{e}nyi in 1957, Parry in 1960, Bertrand-Mathis in 1989, and Fabre in 1995

math.CO

On Periodic Alternate Base Expansions

For an alternate base $\boldsymbolβ=(β_0,\ldots,β_{p-1})$, we show that if all rational numbers in the unit interval $[0,1)$ have periodic expansions with respect to the $p$ shifts of $\boldsymbolβ$, then the bases $β_0,\ldots,β_{p-1}$ all belong to the extension field $\mathbb Q(β)$ where $β$ is the product $β_0\cdotsβ_{p-1}$ and moreover, this product $β$ must be either a Pisot or Salem number. We also prove the stronger statement that if the bases $β_0,\ldots,β_{p-1}$ belong to $\mathbb Q(β)$ but the product $β$ is neither a Pisot number nor a Salem number then the set of rationals having an ultimately periodic $\boldsymbolβ$-expansion is nowhere dense in $[0,1)$. Moreover, in the case where the product $β$ is a Pisot number and the bases $β_0,\ldots,β_{p-1}$ all belong to $\mathbb Q(β)$, we prove that the set of points in $[0,1)$ having an ultimately periodic $\boldsymbolβ$-expansion is precisely the set $\mathbb Q(β)\cap[0,1)$. For the restricted case of Rényi real bases, i.e., for $p=1$ in our setting, our method gives rise to an elementary proof of Schmidt's original result. Therefore, even though our results generalize those of Schmidt, our proofs should not be seen as generalizations of Schmidt's original arguments but as an original method in the generalized framework of alternate bases, which moreover gives a new elementary proof of Schmidt's results from 1980. As an application of our results, we show that if $\boldsymbolβ=(β_0,\ldots,β_{p-1})$ is an alternate base such that the product $β$ of the bases is a Pisot number and $β_0,\ldots,β_{p-1}\in\mathbb Q(β)$, then $\boldsymbolβ$ is a Parry alternate base, meaning that the quasi-greedy expansions of $1$ with respect to the $p$ shifts of the base $\boldsymbolβ$ are ultimately periodic.

math.NT

Magic numbers in periodic sequences

In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with d states that can be simulated by an optimal nondeterministic finite automaton with exactly n states? If such a number d exists, it is called magic. In this paper, we consider the magic number problem in the framework of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.

cs.FL