10 citations · 28 across the 12 of their papers we have counts for
7 papers · 1 filter
On the Markov numbers: fixed numerator, denominator, and sum conjectures
Clément Lagisquet, Edita Pelantová, Sébastien Tavenas +1
The Markov numbers are the positive integer solutions of the Diophantine equation . Already in 1880, Markov showed that all these solutions could be generat…
Derivated sequences of complementary symmetric Rote sequences
Kateřina Medková, Edita Pelantová, Laurent Vuillon
Complementary symmetric Rote sequences are binary sequences which have factor complexity for all integers and whose languages are closed under the…
Palindromic length of words and morphisms in class
Petr Ambrož, Ondřej Kadlec, Zuzana Masáková +1
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class introduced by Hof, Knill and Simon. We show that it grows at mo…
A note on palindromic length of Sturmian sequences
Petr Ambrož, Edita Pelantová
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word as the minimal number of palindromes whose concatenation is equal to . For an infinite word…
Exchange of three intervals: itineraries, substitutions and palindromicity
Zuzana Masáková, Edita Pelantová, Štěpán Starosta
Given a symmetric exchange of three intervals, we provide a detailed description of the return times to a subinterval and the corresponding itineraries. We apply our results to mor…
Palindromic Saturation
L. Balková, E. Pelantová
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 t…