A unique extension of rich words

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F21%3A00354375" target="_blank" >RIV/68407700:21340/21:00354375 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

A unique extension of rich words

Popis výsledku v původním jazyce

A word w is called rich if it contains |w|+1 palindromic factors, including the empty word. We say that a rich word w can be extended in at least two ways if there are two distinct letters x, y such that wx, wy are rich. Let R denote the set of all rich words. Given w in R let K(w) denote the set of all words u such that wu is in R and wu can be extended in at least two ways. Let o(w) = min{|u| : u in K(w)} and let phi(n) = max {o(w) : w in R and |w|=n}, where n>0. Vesti (2014) showed that phi(n) < 2n+1. In other words, it says that for each w in R there is a word u with |u|<2|w| such that wu is in R and wu can be extended in at least two ways. We prove that phi(n)<n+1 and that lim sup phi(n)/n is greater than or equal to 2/9 as n tends to infinity. The results hold for each finite alphabet having at least two letters.

Název v anglickém jazyce

A unique extension of rich words

Popis výsledku anglicky

A word w is called rich if it contains |w|+1 palindromic factors, including the empty word. We say that a rich word w can be extended in at least two ways if there are two distinct letters x, y such that wx, wy are rich. Let R denote the set of all rich words. Given w in R let K(w) denote the set of all words u such that wu is in R and wu can be extended in at least two ways. Let o(w) = min{|u| : u in K(w)} and let phi(n) = max {o(w) : w in R and |w|=n}, where n>0. Vesti (2014) showed that phi(n) < 2n+1. In other words, it says that for each w in R there is a word u with |u|<2|w| such that wu is in R and wu can be extended in at least two ways. We prove that phi(n)<n+1 and that lim sup phi(n)/n is greater than or equal to 2/9 as n tends to infinity. The results hold for each finite alphabet having at least two letters.

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í

2021

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

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

1879-2294

Svazek periodika

896

Číslo periodika v rámci svazku

December

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

12

Strana od-do

53-64

Kód UT WoS článku

000718281500005

EID výsledku v databázi Scopus

—