A Probabilistic Approach to Generalized Zeckendorf Decompositions

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence. The expansions are finite sequences of nonnegative integer coefficients (satisfying certain technical conditions to guarantee uniqueness of the decomposition) and which can be viewed as analogs of sequences of variable-length words made from some fixed alphabet. In this paper we present a new approach and construction for uniform measures on expansions, identifying them as the distribution of a Markov chain conditioned not to hit a set. This gives a unified approach that allows us to easily recover results on the expansions from analogous results for Markov chains, and in this paper we focus on laws of large numbers, central limit theorems for sums of digits, and statements on gaps (zeros) in expansions. We expect the approach to prove useful in other similar contexts.Comment: Version 1.0, 25 pages. Keywords: Zeckendorf decompositions, positive linear recurrence relations, distribution of gaps, longest gap, Markov processe

Abstract numeration systems on bounded languages and multiplication by a constant

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with at least three letters, we show that multiplication by an integer $\lambda\ge2$ does not preserve $S$-recognizability, meaning that there always exists a $S$-recognizable set $X$ such that $\lambda X$ is not $S$-recognizable. The main tool is a bijection between the representation of an integer over a bounded language and its decomposition as a sum of binomial coefficients with certain properties, the so-called combinatorial numeration system

Some linear recurrences and their combinatorial interpretation by means of regular languages

AbstractIn this paper we apply ECO method and the concept of numeration systems to give a combinatorial interpretation to linear recurrences of the kind an=kan−1+han−2, where k>|h|⩾0. In particular, we define a language L such that the words of L having length n satisfy the recurrence, and then we describe a recursive construction for this language, according to the ECO method, and the corresponding finite succession rule

Rational series and asymptotic expansion for linear homogeneous divide-and-conquer recurrences

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been studied from the asymptotic standpoint. We show how a mechanical process permits to compute their asymptotic expansion. It is based on linear algebra, with Jordan normal form, joint spectral radius, and dilation equations. The method is compared with the analytic number theory approach, based on Dirichlet series and residues, and new ways to compute the Fourier series of the periodic functions involved in the expansion are developed. The article comes with an extended bibliography

Ergodic properties of {\beta}-adic Halton sequences

We investigate a parametric extension of the classical s-dimensional Halton sequence, where the bases are special Pisot numbers. In a one- dimensional setting the properties of such sequences have already been in- vestigated by several authors [5, 8, 23, 28]. We use methods from ergodic theory to in order to investigate the distribution behavior of multidimen- sional versions of such sequences. As a consequence it is shown that the Kakutani-Fibonacci transformation is uniquely ergodic