The asymptotic repetition threshold of sequences rich in palindromes

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00385808" target="_blank" >RIV/68407700:21240/25:00385808 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21340/25:00385808

Výsledek na webu

<a href="https://doi.org/10.1016/j.ejc.2025.104124" target="_blank" >https://doi.org/10.1016/j.ejc.2025.104124</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ejc.2025.104124" target="_blank" >10.1016/j.ejc.2025.104124</a>

Jazyk výsledku

angličtina

Název v původním jazyce

The asymptotic repetition threshold of sequences rich in palindromes

Popis výsledku v původním jazyce

he 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 class. On the one hand, if we consider the class of all d-ary sequences with d>1, then the asymptotic repetition threshold is equal to one, independently of the alphabet size. On the other hand, for the class of episturmian sequences, the repetition threshold depends on the alphabet size. We focus on rich sequences, i.e., sequences whose factors contain the maximum possible number of distinct palindromes. The class of episturmian sequences forms a subclass of rich sequences. We prove that the asymptotic repetition threshold for the class of rich recurrent d-ary sequences, with d>1, is equal to two, independently of the alphabet size.

Název v anglickém jazyce

The asymptotic repetition threshold of sequences rich in palindromes

Popis výsledku anglicky

he 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 class. On the one hand, if we consider the class of all d-ary sequences with d>1, then the asymptotic repetition threshold is equal to one, independently of the alphabet size. On the other hand, for the class of episturmian sequences, the repetition threshold depends on the alphabet size. We focus on rich sequences, i.e., sequences whose factors contain the maximum possible number of distinct palindromes. The class of episturmian sequences forms a subclass of rich sequences. We prove that the asymptotic repetition threshold for the class of rich recurrent d-ary sequences, with d>1, is equal to two, independently of the alphabet size.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

European Journal of Combinatorics

ISSN

0195-6698

e-ISSN

1095-9971

Svazek periodika

126

Číslo periodika v rámci svazku

May

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

28

Strana od-do

—

Kód UT WoS článku

001422195200001

EID výsledku v databázi Scopus

2-s2.0-85216337979