Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Dvořáková, Ľubomíra"'
The asymptotic critical exponent measures for a sequence the maximum repetition rate of factors of growing length. The infimum of asymptotic critical exponents of sequences of a certain class is called the asymptotic repetition threshold of that clas
Externí odkaz:
http://arxiv.org/abs/2409.06849
We define a new class of ternary sequences that are 2-balanced. These sequences are obtained by colouring of Sturmian sequences. We show that the class contains sequences of any given letter frequencies. We provide an upper bound on factor and abelia
Externí odkaz:
http://arxiv.org/abs/2403.12791
Autor:
Dvořáková, Lubomíra, Pelantová, Edita
The repetition threshold of a class $C$ of infinite $d$-ary sequences is the smallest real number $r$ such that in the class $C$ there exists a sequence that avoids $e$-powers for all $e> r$. This notion was introduced by Dejean in 1972 for the class
Externí odkaz:
http://arxiv.org/abs/2309.00988
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 26:3, Combinatorics (November 4, 2024) dmtcs:12385
In this paper, we describe minimal string attractors (of size two) of pseudopalindromic prefixes of standard complementary-symmetric Rote sequences. Such a class of Rote sequences forms a subclass of binary generalized pseudostandard sequences, i.e.,
Externí odkaz:
http://arxiv.org/abs/2308.00850
Autor:
Dvořáková, Lubomíra, Pelantová, Edita
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 infin
Externí odkaz:
http://arxiv.org/abs/2211.11877
Autor:
Dvořáková, Lubomíra
In this paper, we describe string attractors of all factors of episturmian sequences and show that their size is equal to the number of distinct letters contained in the factor.
Externí odkaz:
http://arxiv.org/abs/2211.01660
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
Externí odkaz:
http://arxiv.org/abs/2208.00366
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
Externí odkaz:
http://arxiv.org/abs/2112.02854
We study aperiodic balanced sequences over finite alphabets. A sequence vv of this type is fully characterised by a Sturmian sequence u and two constant gap sequences y and y'. We show that the language of v is eventually dendric and we focus on retu
Externí odkaz:
http://arxiv.org/abs/2108.07503