6,671 research outputs found
Abstract numeration systems on bounded languages and multiplication by a constant
A set of integers is -recognizable in an abstract numeration system 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
does not preserve -recognizability, meaning that there always
exists a -recognizable set such that is not
-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
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-
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
Syndeticity and independent substitutions
We associate in a canonical way a substitution to any abstract numeration
system built on a regular language. In relationship with the growth order of
the letters, we define the notion of two independent substitutions. Our main
result is the following. If a sequence is generated by two independent
substitutions, at least one being of exponential growth, then the factors of
appearing infinitely often in appear with bounded gaps. As an
application, we derive an analogue of Cobham's theorem for two independent
substitutions (or abstract numeration systems) one with polynomial growth, the
other being exponential
Central sets and substitutive dynamical systems
In this paper we establish a new connection between central sets and the
strong coincidence conjecture for fixed points of irreducible primitive
substitutions of Pisot type. Central sets, first introduced by Furstenberg
using notions from topological dynamics, constitute a special class of subsets
of \nats possessing strong combinatorial properties: Each central set
contains arbitrarily long arithmetic progressions, and solutions to all
partition regular systems of homogeneous linear equations. We give an
equivalent reformulation of the strong coincidence condition in terms of
central sets and minimal idempotent ultrafilters in the Stone-\v{C}ech
compactification \beta \nats . This provides a new arithmetical approach to
an outstanding conjecture in tiling theory, the Pisot substitution conjecture.
The results in this paper rely on interactions between different areas of
mathematics, some of which had not previously been directly linked: They
include the general theory of combinatorics on words, abstract numeration
systems, tilings, topological dynamics and the algebraic/topological properties
of Stone-\v{C}ech compactification of \nats.Comment: arXiv admin note: substantial text overlap with arXiv:1110.4225,
arXiv:1301.511
- …