Searcharxiv⌕ Search

arXiv subjects

Edita Pelantová

Publications and source records attributed to Edita Pelantová.

At least 37 records · Page 2Linked to original sources

From positional representation of numbers to positional representation of vectors

To represent real $m$-dimensional vectors, a positional vector system given by a non-singular matrix $M \in \mathbb{Z}^{m \times m}$ and a digit set $\mathcal{D} \subset \mathbb{Z}^m$ is used. If $m = 1$, the system coincides with the well known numeration system used to represent real numbers. We study some properties of the vector systems which are transformable from the case $m = 1$ to higher dimensions. We focus on algorithm for parallel addition and on systems allowing an eventually periodic representation of vectors with rational coordinates.

cs.DC↗

On a faithful representation of Sturmian morphisms

The set of morphisms mapping any Sturmian sequence to a Sturmian sequence forms together with composition the so-called monoid of Sturm. For this monoid, we defne a faithful representation by $(3\times 3)$-matrices with integer entries. We find three convex cones in $\mathbb{R}^3$ and show that a matrix $R \in Sl(\mathbb{Z},3)$ is a matrix representing a Sturmian morphism if the three cones are invariant under multiplication by $R$ or $R^{-1}$. This property offers a new tool to study Sturmian sequences. We provide alternative proofs of four known results on Sturmian sequences fixed by a primitive morphism and a new result concerning the square root of a Sturmian sequence.

math.CO↗

An upper bound on asymptotic repetitive threshold of balanced sequences via colouring of the Fibonacci sequence

We colour the Fibonacci sequence by suitable constant gap sequences to provide an upper bound on the asymptotic repetitive threshold of $d$-ary balanced sequences. The bound is attained for $d=2, 4$ and $8$ and we conjecture that it happens for infinitely many even $d$'s. Our bound reveals an essential difference in behavior of the repetitive threshold and the asymptotic repetitive threshold of balanced sequences. The repetitive threshold of $d$-ary balanced sequences is known to be at least $1+\frac{1}{d-2}$ for each $d \geq 3$. In contrast, our bound implies that the asymptotic repetitive threshold of $d$-ary balanced sequences is at most $1+\frac{τ^3}{2^{d-3}}$ for each $d\geq 2$, where $τ$ is the golden mean.

math.CO↗

Asymptotic repetitive threshold of balanced sequences

The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary sequence $\mathbf u$. We define the asymptotic critical exponent $E^*(\mathbf u)$ as the upper limit of the maximal repetition of factors of length $n$. We show that for any $d>1$ there exists a $d$-ary sequence $\mathbf u$ having $E^*(\mathbf u)$ arbitrarily close to $1$. Then we focus on the class of $d$-ary balanced sequences. In this class, the values $E^*(\mathbf u)$ are bounded from below by a threshold strictly bigger than 1. We provide a method which enables us to find a $d$-ary balanced sequence with the least asymptotic critical exponent for $2\leq d\leq 10$.

math.CO↗

On morphisms preserving palindromic richness

It is known that each word of length $n$ contains at most $n+1$ distinct palindromes. A finite rich word is a word with maximal number of palindromic factors. The definition of palindromic richness can be naturally extended to infinite words. Sturmian words and Rote complementary symmetric sequences form two classes of binary rich words, while episturmian words and words coding symmetric $d$-interval exchange transformations give us other examples on larger alphabets. In this paper we look for morphisms of the free monoid, which allow us to construct new rich words from already known rich words. We focus on morphisms in Class $P_{ret}$. This class contains morphisms injective on the alphabet and satisfying a particular palindromicity property: for every morphism $φ$ in the class there exists a palindrome $w$ such that $φ(a)w$ is a first complete return word to $w$ for each letter $a$. We characterize $P_{ret}$ morphisms which preserve richness over a binary alphabet. We also study marked $P_{ret}$ morphisms acting on alphabets with more letters. In particular we show that every Arnoux-Rauzy morphism is conjugated to a morphism in Class $P_{ret}$ and that it preserves richness.

cs.FL↗

Spectrum, algebraicity and normalization in alternate bases

The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbolβ=(β_0,\dots,β_{p-1})$ determining sofic systems. We show that a necessary condition is that the product $δ=\prod_{i=0}^{p-1}β_i$ is an algebraic integer and all of the bases $β_0,\ldots,β_{p-1}$ belong to the algebraic field ${\mathbb Q}(δ)$. On the other hand, we also give a sufficient condition: if $δ$ is a Pisot number and $β_0,\ldots,β_{p-1}\in {\mathbb Q}(δ)$, then the system associated with the alternate base $\boldsymbolβ=(β_0,\dots,β_{p-1})$ is sofic. The second aim of this paper is to provide an analogy of Frougny's result concerning normalization of real bases representations. We show that given an alternate base $\boldsymbolβ=(β_0,\dots,β_{p-1})$ such that $δ$ is a Pisot number and $β_0,\ldots,β_{p-1}\in {\mathbb Q}(δ)$, the normalization function is computable by a finite Büchi automaton, and furthermore, we effectively construct such an automaton. An important tool in our study is the spectrum of numeration systems associated with alternate bases. The spectrum of a real number $δ>1$ and an alphabet $A\subset {\mathbb Z}$ was introduced by Erdős et al. For our purposes, we use a generalized concept with $δ\in{\mathbb C}$ and $A\subset{\mathbb C}$ and study its topological properties.

math.CO↗

On minimal critical exponent of balanced sequences

We study the threshold between avoidable and unavoidable repetitions in infinite balanced sequences over finite alphabets. The conjecture stated by Rampersad, Shallit and Vandomme says that the minimal critical exponent of balanced sequences over the alphabet of size $d \geq 5$ equals $\frac{d-2}{d-3}$. This conjecture is known to hold for $d\in \{5, 6, 7,8,9,10\}$. We refute this conjecture by showing that the picture is different for bigger alphabets. We prove that critical exponents of balanced sequences over an alphabet of size $d\geq 11$ are lower bounded by $\frac{d-1}{d-2}$ and this bound is attained for all even numbers $d\geq 12$. According to this result, we conjecture that the least critical exponent of a balanced sequence over $d$ letters is $\frac{d-1}{d-2}$ for all $d\geq 11$.

math.CO↗

On positional representation of integer vectors

We show that any $m\times m$ matrix $M$ with integer entries and $\det M =Δ\neq 0$ can be equipped by a finite digit set $\mathcal{D}\subset\mathbb{Z}^m$ such that any integer $m$-dimensional vector belongs to the set $$ {\rm Fin}_{\mathcal{D}}(M)= \Bigl\{\sum_{k\in I}M^k {d}_k : \emptyset\neq I \text{ finite subset of } \mathbb{Z} \text{ and } {d}_k \in \mathcal{D} \text{ for each } k \in I\Bigr\} \subset \bigcup\limits_{k\in \mathbb{N}} \frac{1}{Δ^k}\mathbb{Z}^{m} \,. $$ We also characterize the matrices $M$ for which the sets $ {\rm Fin}_{\mathcal{D}}(M)$ and $ \bigcup\limits_{k\in \mathbb{N}} \frac{1}{Δ^k}\mathbb{Z}^{m}$ coincide.

math.NT↗

On the Markov numbers: fixed numerator, denominator, and sum conjectures

The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and useful) to index the Markov numbers by the rationals between 0 and 1 which stand at the same place in the Stern-Brocot binary tree. The Frobenius conjecture claims that each Markov number appears at most once in the tree. In particular, if the conjecture is true, the order of Markov numbers would establish a new strict order on the rationals. Aigner suggested three conjectures to better understand this order. The first one has already been solved for a few months. We prove that the other two conjectures are also true. Along the way, we generalize Markov numbers to any couple (p,q) of nonnegative integers (not only when they are relatively primes) and conjecture that the unicity is still true as soon as $p \leq q$. Finally, we show that the three conjectures are in fact true for this superset.

math.CO↗

Lattice Bounded Distance Equivalence for 1D Delone Sets with Finite Local Complexity

Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we characterize, dependingly on digits in the corresponding numeration systems, the spectra which are bounded distance to an average lattice. Our method stems in interpretation of the spectra in the frame of the cut-and-project method. Such structures are coded by an infinite word over a finite alphabet which enables us to exploit combinatorial notions such as balancedness, substitutions and the spectrum of associated incidence matrices.

math.NT↗

Complementary symmetric Rote sequences: the critical exponent and the recurrence function

We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the corresponding standard Sturmian sequences. The results are based on a thorough study of return words to bispecial factors of Sturmian sequences. Using the formula for the critical exponent, we describe all complementary symmetric Rote sequences with the critical exponent less than or equal to 3, and we show that there are uncountably many complementary symmetric Rote sequences with the critical exponent less than the critical exponent of the Fibonacci sequence. Our study is motivated by a~conjecture on sequences rich in palindromes formulated by Baranwal and Shallit. Its recent solution by Curie, Mol, and Rampersad uses two particular complementary symmetric Rote sequences.

math.CO↗

On non-repetitive complexity of Arnoux-Rauzy words

The non-repetitive complexity $nr\mathcal{C}_{\bf u}$ and the initial non-repetitive complexity $inr\mathcal{C}_{\bf u}$ are functions which reflect the structure of the infinite word ${\bf u}$ with respect to the repetitions of factors of a given length. We determine $nr\mathcal{C}_{\bf u}$ for the Arnoux-Rauzy words and $inr\mathcal{C}_{\bf u}$ for the standard Arnoux-Rauzy words. Our main tools are $S$-adic representation of Arnoux-Rauzy words and description of return words to their factors. The formulas we obtain are then used to evaluate $nr\mathcal{C}_{\bf u}$ and $inr\mathcal{C}_{\bf u}$ for the $d$-bonacci word.

math.CO↗

On generalized self-similarities of cut-and-project sets

Cut-and-project sets $Σ\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project sets find application in solid state physics as mathematical models of atomic positions in quasicrystals, the description of their symmetries is therefore of high importance. We focus on the question when a linear map $A$ on $\mathbb{R}^n$ is a self-similarity of a cut-and-project set $Σ$, i.e.\ satisfies $AΣ\subsetΣ$. We characterize such mappings $A$ and provide a construction of a suitable cut-and-project set $Σ$. We determine minimal dimension of a lattice which permits construction of such a set $Σ$.

math-ph↗

On Sturmian substitutions closed under derivation

Occurrences of a factor $w$ in an infinite uniformly recurrent sequence ${\bf u}$ can be encoded by an infinite sequence over a finite alphabet. This sequence is usually denoted ${\bf d_{\bf u}}(w)$ and called the derived sequence to $w$ in ${\bf u}$. If $w$ is a prefix of a fixed point ${\bf u}$ of a primitive substitution $φ$, then by Durand's result from 1998, the derived sequence ${\bf d_{\bf u}}(w)$ is fixed by a primitive substitution $ψ$ as well. For a non-prefix factor $w$, the derived sequence ${\bf d_{\bf u}}(w)$ is fixed by a substitution only exceptionally. To study this phenomenon we introduce a new notion: A finite set $M $ of substitutions is said to be closed under derivation if the derived sequence ${\bf d_{\bf u}}(w)$ to any factor $w$ of any fixed point ${\bf u}$ of $φ\in M$ is fixed by a morphism $ψ\in M$. In our article we characterize the Sturmian substitutions which belong to a set $M$ closed under derivation. The characterization uses either the slope and the intercept of its fixed point or its S-adic representation.

math.DS↗

Morphisms generating antipalindromic words

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism $\mathrm{E}:\{0,1\}^*\to\{0,1\}^*$, defined by $\mathrm{E}(w_1\cdots w_n)=(1-w_{n})\cdots(1-w_1)$. We conjecture that these two classes contain all morphisms (up to conjugation) which generate infinite words with infinitely many antipalindromes. This is an analogue to the famous HKS conjecture concerning infinite words containing infinitely many palindromes. We prove our conjecture for two special classes of morphisms, namely (i) uniform morphisms and (ii) morphisms with fixed points containing also infinitely many palindromes.

math.CO↗

Derivated sequences of complementary symmetric Rote sequences

Complementary symmetric Rote sequences are binary sequences which have factor complexity $\mathcal{C}(n) = 2n$ for all integers $n \geq 1$ and whose languages are closed under the exchange of letters. These sequences are intimately linked to Sturmian sequences. Using this connection we investigate the return words and the derivated sequences to the prefixes of any complementary symmetric Rote sequence $\mathbf{v}$ which is associated with a standard Sturmian sequence $\mathbf{u}$. We show that any non-empty prefix of $\mathbf{v}$ has three return words. We prove that any derivated sequence of $\mathbf{v}$ is coding of three interval exchange transformation and we determine the parameters of this transformation. We also prove that $\mathbf{v}$ is primitive substitutive if and only if $\mathbf{u}$ is primitive substitutive. Moreover, if the sequence $\mathbf{u}$ is a fixed point of a primitive morphism, then all derivated sequences of $\mathbf{v}$ are also fixed by primitive morphisms. In that case we provide an algorithm for finding these fixing morphisms.

math.CO↗

Palindromic length of words and morphisms in class $\mathcal{P}$

We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class $\mathcal{P}$ introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word and the Thue-Morse word we provide estimates on the constants of the growth. We also construct an infinite word rich in palindromes for which the palindromic length grows as $\sqrt{n}$.

math.CO↗