2,603 research outputs found
Multidimensional extension of the Morse--Hedlund theorem
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a
sequence over a finite alphabet is ultimately periodic if and only if, for
some , the number of different factors of length appearing in is
less than . Attempts to extend this fundamental result, for example, to
higher dimensions, have been considered during the last fifteen years. Let
. A legitimate extension to a multidimensional setting of the notion of
periodicity is to consider sets of \ZZ^d definable by a first order formula
in the Presburger arithmetic . With this latter notion and using a
powerful criterion due to Muchnik, we exhibit a complete extension of the
Morse--Hedlund theorem to an arbitrary dimension $d$ and characterize sets of
$\ZZ^d$ definable in in terms of some functions counting recurrent
blocks, that is, blocks occurring infinitely often
Unification of Relativistic and Quantum Mechanics from Elementary Cycles Theory
In Elementary Cycles theory elementary quantum particles are consistently
described as the manifestation of ultra-fast relativistic spacetime cyclic
dynamics, classical in the essence. The peculiar relativistic geometrodynamics
of Elementary Cycles theory yields de facto a unification of ordinary
relativistic and quantum physics. In particular its classical-relativistic
cyclic dynamics reproduce exactly from classical physics first principles all
the fundamental aspects of Quantum Mechanics, such as all its axioms, the
Feynman path integral, the Dirac quantisation prescription (second
quantisation), quantum dynamics of statistical systems, non-relativistic
quantum mechanics, atomic physics, superconductivity, graphene physics and so
on. Furthermore the theory allows for the explicit derivation of gauge
interactions, without postulating gauge invariance, directly from relativistic
geometrodynamical transformations, in close analogy with the description of
gravitational interaction in general relativity. In this paper we summarise
some of the major achievements, rigorously proven also in several recent
peer-reviewed papers, of this innovative formulation of quantum particle
physics.Comment: 35 page
Local Complexity of Delone Sets and Crystallinity
This paper characterizes when a Delone set X is an ideal crystal in terms of
restrictions on the number of its local patches of a given size or on the
hetereogeneity of their distribution. Let N(T) count the number of
translation-inequivalent patches of radius T in X and let M(T) be the minimum
radius such that every closed ball of radius M(T) contains the center of a
patch of every one of these kinds. We show that for each of these functions
there is a `gap in the spectrum' of possible growth rates between being bounded
and having linear growth, and that having linear growth is equivalent to X
being an ideal crystal. Explicitly, for N(T), if R is the covering radius of X
then either N(T) is bounded or N(T) >= T/2R for all T>0. The constant 1/2R in
this bound is best possible in all dimensions. For M(T), either M(T) is bounded
or M(T) >= T/3 for all T>0. Examples show that the constant 1/3 in this bound
cannot be replaced by any number exceeding 1/2. We also show that every
aperiodic Delone set X has M(T) >= c(n)T for all T>0, for a certain constant
c(n) which depends on the dimension n of X and is greater than 1/3 when n > 1.Comment: 26 pages. Uses latexsym and amsfonts package
Repetitive Delone Sets and Quasicrystals
This paper considers the problem of characterizing the simplest discrete
point sets that are aperiodic, using invariants based on topological dynamics.
A Delone set whose patch-counting function N(T), for radius T, is finite for
all T is called repetitive if there is a function M(T) such that every ball of
radius M(T)+T contains a copy of each kind of patch of radius T that occurs in
the set. This is equivalent to the minimality of an associated topological
dynamical system with R^n-action. There is a lower bound for M(T) in terms of
N(T), namely N(T) = O(M(T)^n), but no general upper bound.
The complexity of a repetitive Delone set can be measured by the growth rate
of its repetitivity function M(T). For example, M(T) is bounded if and only if
the set is a crystal. A set is called is linearly repetitive if M(T) = O(T) and
densely repetitive if M(T) = O(N(T))^{1/n}). We show that linearly repetitive
sets and densely repetitive sets have strict uniform patch frequencies, i.e.
the associated topological dynamical system is strictly ergodic. It follows
that such sets are diffractive. In the reverse direction, we construct a
repetitive Delone set in R^n which has
M(T) = O(T(log T)^{2/n}(log log log T)^{4/n}), but does not have uniform
patch frequencies. Aperiodic linearly repetitive sets have many claims to be
the simplest class of aperiodic sets, and we propose considering them as a
notion of "perfectly ordered quasicrystal".Comment: To appear in "Ergodic Theory and Dynamical Systems" vol.23 (2003). 37
pages. Uses packages latexsym, ifthen, cite and files amssym.def, amssym.te
Arctic curves of the octahedron equation
We study the octahedron relation (also known as the -system),
obeyed in particular by the partition function for dimer coverings of the Aztec
Diamond graph. For a suitable class of doubly periodic initial conditions, we
find exact solutions with a particularly simple factorized form. For these, we
show that the density function that measures the average dimer occupation of a
face of the Aztec graph, obeys a system of linear recursion relations with
periodic coefficients. This allows us to explore the thermodynamic limit of the
corresponding dimer models and to derive exact "arctic" curves separating the
various phases of the system.Comment: 39 pages, 21 figures; typos fixed, four references and an appendix
adde
Relations on words
In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our presentation tries to set up a unified framework with respect to a given binary relation.
In the second part, we mainly focus on abelian equivalence, -abelian equivalence, combinatorial coefficients and associated relations, Parikh matrices and -equivalence. In particular, some new refinements of abelian equivalence are introduced
- …