Search

In this paper, we study the critical exponent of infinite words $\ubeta$ coding $\beta$-integers for $\beta$ being a~non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in the infinite word in question. We calculate also the ultimate critical exponent that expresses how long repetitions occur in the infinite word $\ubeta$ when the factors of length growing ad infinitum are considered. The basic ingredients of our method are the description of all bispecial factors of $\ubeta$ and the notion of return words. This method can be applied to any fixed point of any primitive substitution., Comment: 24 pages

We study the numeration system with negative basis, introduced by Ito and Sadahiro. We focus on arithmetic operations in the set ${\rm Fin}(-\beta)$ and $\Z_{-\beta}$ of numbers having finite resp. integer $(-\beta)$-expansions. We show that ${\rm Fin}(-\beta)$ is trivial if $\beta$ is smaller than the golden ratio $\frac12(1+\sqrt5)$. For $\beta\geq\frac12(1+\sqrt5)$ we prove that ${\rm Fin}(-\beta)$ is a ring, only if $\beta$ is a Pisot or Salem number with no negative conjugates. We prove the conjecture of Ito and Sadahiro that ${\rm Fin}(-\beta)$ is a ring if $\beta$ is a quadratic Pisot number with positive conjugate. For quadratic Pisot units we determine the number of fractional digits that may appear when adding or multiplying two $(-\beta)$-integers., Comment: 13 pages

In this paper, we study representations of real numbers in the positional numeration system with negative basis, as introduced by Ito and Sadahiro. We focus on the set $\Z_{-\beta}$ of numbers whose representation uses only non-negative powers of $-\beta$, the so-called $(-\beta)$-integers. We describe the distances between consecutive elements of $\Z_{-\beta}$. In case that this set is non-trivial we associate to $\beta$ an infinite word $\boldsymbol{v}_{-\beta}$ over an (in general infinite) alphabet. The self-similarity of $\Z_{-\beta}$, i.e., the property $-\beta \Z_{-\beta}\subset \Z_{-\beta}$, allows us to find a morphism under which $\boldsymbol{v}_{-\beta}$ is invariant. On the example of two cubic irrational bases $\beta$ we demonstrate the difference between Rauzy fractals generated by $(-\beta)$-integers and by $\beta$-integers., Comment: 25 pages, 8 figures

We focus on infinite words with languages closed under reversal. If frequencies of all factors are well defined, we show that the number of different frequencies of factors of length n+1 does not exceed 2C(n+1)-2C(n)+1., Comment: 7 pages

Classical crystals are solid materials containing arbitrarily long periodic repetitions of a single motif. In this paper, we study the maximal possible repetition of the same motif occurring in beta-integers -- one dimensional models of quasicrystals. We are interested in beta-integers realizing only a finite number of distinct distances between neighboring elements. In such a case, the problem may be reformulated in terms of combinatorics on words as a study of the index of infinite words coding beta-integers. We will solve a particular case for beta being a quadratic non-simple Parry number., Comment: 11 pages

We consider two {seemingly} different definitions of infinite words which contain {the} utmost number of palindromes. We show that these two definitions coincide. {The keynote of the proof is a meticulous inspection of properties of complete return words and the application of some basic graph theory.} In fact, we provide another proof of the result announced in \cite{Zamboni}., Comment: 6 pages

Beta-integers (``$\beta$-integers'') are those numbers which are the counterparts of integers when real numbers are expressed in irrational basis $\beta > 1$. In quasicrystalline studies $\beta$-integers supersede the ``crystallographic'' ordinary integers. When the number $\beta$ is a Parry number, the corresponding $\beta$-integers realize only a finite number of distances between consecutive elements and somewhat appear like ordinary integers, mainly in an asymptotic sense. In this letter we make precise this asymptotic behavior by proving four theorems concerning Parry $\beta$-integers., Comment: 17 pages

We study infinite words coding an orbit under an exchange of three intervals which have full complexity $\C(n)=2n+1$ for all $n\in\N$ (non-degenerate 3iet words). In terms of parameters of the interval exchange and the starting point of the orbit we characterize those 3iet words which are invariant under a primitive substitution. Thus, we generalize the result recently obtained for sturmian words.

An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A morphism is said to be 3iet preserving if it maps any 3iet word to another 3iet word. It is known that the monoid of morphisms preserving sturmian words is finitely generated. On the contrary, in this note we prove that the monoid of 3iet preserving morphisms is not finitely generated, that is, there are infinitely many 3iet preserving morphisms, which cannot be written as a non-trivial decomposition of other 3iet preserving morphisms., Comment: 9 pages, 1 figure

We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid $\{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \det\boldsymbol{M}=\pm1\} = \{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E}\}$, where $\boldsymbol{E} = (\begin{smallmatrix}0&1 -1&0\end{smallmatrix})$. We prove that in case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid $\{\boldsymbol{M}\in\mathbb{N}^{3\times 3} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E},\ \det\boldsymbol{M}=\pm 1\}$, where $\boldsymbol{E} = \Big(\begin{smallmatrix}0&1&1 -1&0&1 -1&-1&0\end{smallmatrix}\Big)$., Comment: 26 pages, 4 figures

In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n., Comment: 14 pages

One-dimensional cut-and-project point sets obtained from the square lattice in the plane are considered from a unifying point of view and in the perspective of aperiodic wavelet constructions. We successively examine their geometrical aspects, combinatorial properties from the point of view of the theory of languages, and self-similarity with algebraic scaling factor $\theta$. We explain the relation of the cut-and-project sets to non-standard numeration systems based on $\theta$. We finally examine the substitutivity, a weakened version of substitution invariance, which provides us with an algorithm for symbolic generation of cut-and-project sequences.

We describe the normalizers for all non-conjugate maximal Abelian subgroups of diagonalizable automorphisms of sl(3,C) and show their relation to the symmetries of equations related to the graded contraction.

We consider the grading of $sl(n,\mathbb{C})$ by the group $\Pi_n$ of generalized Pauli matrices. The grading decomposes the Lie algebra into $n^2-1$ one--dimensional subspaces. In the article we demonstrate that the normalizer of grading decomposition of $sl(n,\mathbb{C})$ in $\Pi_n$ is the group $SL(2, \mathbb{Z}_n)$, where $\mathbb{Z}_n$ is the cyclic group of order $n$. As an example we consider $sl(3,\mathbb{C})$ graded by $\Pi_3$ and all contractions preserving that grading. We show that the set of 48 quadratic equations for grading parameters splits into just two orbits of the normalizer of the grading in $\Pi_3$.

We give the general solution of three Diophantine equations in the ring of integer of the algebraic number field ${\bf Q}[{\sqr 5}]$. These equations are related to the problem of determination of the minimum distance in quasicrystals with fivefold symmetry., Comment: 4 pages