102 research outputs found
Non-Injectivity of Infinite Interval Exchange Transformations and Generalized Thue-Morse Sequences
In this paper we study the non-injectivity arising in infinite interval
exchange transformations. In particular, we build and analyze an infinite
family of infinite interval exchanges semi-conjugated to generalized Thue-Morse
subshifts, whose non-injectivity occurs at a characterizable finite set of
points.Comment: 23 pages, 8 figure
Recommended from our members
Forward Limit Sets of Semigroups of Substitutions and Arithmetic Progressions in Automatic Sequences
This thesis deals with symbolic sequences generated by semigroups of substitutions acting on finite alphabets.
First, we investigate the underlying structure of certain automatic sequences by studying the maximum length A(d) of the monochromatic arithmetic progressions of difference d appearing in these sequences. For example, for the Thue-Morse sequence and a class of generalised Thue-Morse sequences, we give exact values of A(d) or upper bounds on it, for certain differences d. For aperiodic, primitive, bijective substitutions and spin substitutions, which are generalisations of the Thue-Morse and Rudin-Shapiro substitutions, respectively, we study the asymptotic growth rate of A(d). In particular, we prove that there exists a subsequence (d_n) of differences along which A(d_n) grows at least polynomially in d_n. Explicit upper and lower bounds for the growth exponent can be derived from a finite group associated to the substitution considered.
Next, we introduce the forward limit set Λ of a semigroup S generated by a family of substitutions of a finite alphabet, which typically coincides with the set of all possible s-adic limits of that family. We provide several alternative characterisations of the forward limit set. For instance, we prove that Λ is the unique maximal closed and strongly S-invariant subset of the space of all infinite words, and we prove that it is the closure of the image under S of the set of all fixed points of S. It is usually difficult to compute a forward limit set explicitly; however, we show that, provided certain assumptions hold, Λ is uncountable, and we supply upper bounds on its size in terms of logarithmic Hausdorff dimension
Recommended from our members
Monochromatic arithmetic progressions in automatic sequences with group structure
We determine asymptotic growth rates for lengths of monochromatic arithmetic progressions in certain automatic sequences. In particular, we look at (one-sided) fixed points of aperiodic, primitive, bijective substitutions and spin substitutions, which are generalisations of the Thue-Morse and Rudin-Shapiro substitutions, respectively. For such infinite words, we show that there exists a subsequence {dn} of differences along which the maximum length A (dn) of a monochromatic arithmetic progression (with fixed difference dn) grows at least polynomially in dn. Explicit upper and lower bounds for the growth exponent can be derived from a finite group associated to the substitution. As an application, we obtain bounds for a van der Waerden-type number for a class of colourings parametrised by the size of the alphabet and the length of the substitution
Arithmetical subword complexity of automatic sequences
We fully classify automatic sequences over a finite alphabet
with the property that each word over appears is along an
arithmetic progression. Using the terminology introduced by Avgustinovich,
Fon-Der-Flaass and Frid, these are the automatic sequences with the maximal
possible arithmetical subword complexity. More generally, we obtain an
asymptotic formula for arithmetical (and even polynomial) subword complexity of
a given automatic sequence .Comment: 14 pages, comments welcom
Review of Particle Physics
The Review summarizes much of particle physics and cosmology. Using data from previous editions, plus 2,143
new measurements from 709 papers, we list, evaluate, and average measured properties of gauge bosons and the
recently discovered Higgs boson, leptons, quarks, mesons, and baryons. We summarize searches for hypothetical
particles such as supersymmetric particles, heavy bosons, axions, dark photons, etc. Particle properties and search
limits are listed in Summary Tables. We give numerous tables, figures, formulae, and reviews of topics such as Higgs
Boson Physics, Supersymmetry, Grand Unified Theories, Neutrino Mixing, Dark Energy, Dark Matter, Cosmology,
Particle Detectors, Colliders, Probability and Statistics. Among the 120 reviews are many that are new or heavily
revised, including a new review on Machine Learning, and one on Spectroscopy of Light Meson Resonances.
The Review is divided into two volumes. Volume 1 includes the Summary Tables and 97 review articles. Volume
2 consists of the Particle Listings and contains also 23 reviews that address specific aspects of the data presented
in the Listings.
The complete Review (both volumes) is published online on the website of the Particle Data Group (pdg.lbl.gov)
and in a journal. Volume 1 is available in print as the PDG Book. A Particle Physics Booklet with the Summary
Tables and essential tables, figures, and equations from selected review articles is available in print, as a web version
optimized for use on phones, and as an Android app.United States Department of Energy (DOE) DE-AC02-05CH11231government of Japan (Ministry of Education, Culture, Sports, Science and Technology)Istituto Nazionale di Fisica Nucleare (INFN)Physical Society of Japan (JPS)European Laboratory for Particle Physics (CERN)United States Department of Energy (DOE
On a generalization of Abelian equivalence and complexity of infinite words
In this paper we introduce and study a family of complexity functions of infinite words indexed by k in Z^+ U {+infinity}. Let k in Z^+ U {+infinity} and A be a finite non-empty set. Two finite words u and v in A* are said to be k-Abelian equivalent if for all x in A* of length less than or equal to k, the number of occurrences of x in u is equal to the number of occurrences of x in v. This defines a family of equivalence relations sim_k on A*, bridging the gap between the usual notion of Abelian equivalence (when k = 1) and equality (when k = +infinity). We show that the number of k-Abelian equivalence classes of words of length n grows polynomially, although the degree is exponential in k. Given an infinite word omega in A^N, we consider the associated complexity function P^(k)_omega : N -> N which counts the number of k-Abelian equivalence classes of factors of omega of length n. We show that the complexity function P_k is intimately linked with periodicity. More precisely we define an auxiliary function q^k : N -> N and show that if P^(k)_omega(n) < q^k(n) for some k in Z^+ U {+infinity} and n >= 0, then omega is ultimately periodic. Moreover if omega is aperiodic, then P^(k)_omega(n) = q^k(n) if and only if omega is Sturmian. We also study k-Abelian complexity in connection with repetitions in words. Using Szemeredi's theorem, we show that if omega has bounded k-Abelian complexity, then for every D subset of N with positive upper density and for every positive integer N, there exists a k-Abelian N-power occurring in omega at some position j in D
A Note On -Rauzy Graphs for the Infinite Fibonacci Word
The -Rauzy graph of order for any infinite word is a directed graph
in which an arc is formed if the concatenation of the word
and the suffix of of length is a subword of the infinite word.
In this paper, we consider one of the important aperiodic recurrent words, the
infinite Fibonacci word for discussion. We prove a few basic properties of the
-Rauzy graph of the infinite Fibonacci word. We also prove that the
-Rauzy graphs for the infinite Fibonacci word are strongly connected.Comment: 10 pages, 4 figure
Review of Particle Physics
The Review summarizes much of particle physics and cosmology. Using data from previous editions, plus 2,143 new measurements from 709 papers, we list, evaluate, and average measured properties of gauge bosons and the recently discovered Higgs boson, leptons, quarks, mesons, and baryons. We summarize searches for hypothetical particles such as supersymmetric particles, heavy bosons, axions, dark photons, etc. Particle properties and search limits are listed in Summary Tables. We give numerous tables, figures, formulae, and reviews of topics such as Higgs Boson Physics, Supersymmetry, Grand Unified Theories, Neutrino Mixing, Dark Energy, Dark Matter, Cosmology, Particle Detectors, Colliders, Probability and Statistics. Among the 120 reviews are many that are new or heavily revised, including a new review on Machine Learning, and one on Spectroscopy of Light Meson Resonances.
The Review is divided into two volumes. Volume 1 includes the Summary Tables and 97 review articles. Volume 2 consists of the Particle Listings and contains also 23 reviews that address specific aspects of the data presented in the Listings.
The complete Review (both volumes) is published online on the website of the Particle Data Group (pdg.lbl.gov) and in a journal. Volume 1 is available in print as the PDG Book. A Particle Physics Booklet with the Summary Tables and essential tables, figures, and equations from selected review articles is available in print, as a web version optimized for use on phones, and as an Android app
- …