Palindromic length and reduction of powers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F22%3A00361402" target="_blank" >RIV/68407700:21340/22:00361402 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Palindromic length and reduction of powers

Popis výsledku v původním jazyce

The palindromic length of a finite word v is the minimum number of palindromes whose concatenation is equal to v. It was conjectured in 2013 that for every aperiodic infinite word x, the palindromic length of its factors is not bounded. Let x be an infinite aperiodic word with a bounded palindromic length and containing infinitely many occurrences of the fifth power u5 of some word u. In this paper, we prove that we can erase from x extra powers of u and of its reversal uR to get another infinite aperiodic word of bounded palindromic length which does not contain u5 nor (uR)5. This result is not sufficient to prove that x does not exist but may give a hint for this proof.(c) 2022 Elsevier B.V. All rights reserved.

Název v anglickém jazyce

Palindromic length and reduction of powers

Popis výsledku anglicky

The palindromic length of a finite word v is the minimum number of palindromes whose concatenation is equal to v. It was conjectured in 2013 that for every aperiodic infinite word x, the palindromic length of its factors is not bounded. Let x be an infinite aperiodic word with a bounded palindromic length and containing infinitely many occurrences of the fifth power u5 of some word u. In this paper, we prove that we can erase from x extra powers of u and of its reversal uR to get another infinite aperiodic word of bounded palindromic length which does not contain u5 nor (uR)5. This result is not sufficient to prove that x does not exist but may give a hint for this proof.(c) 2022 Elsevier B.V. All rights reserved.

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í

2022

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

930

Číslo periodika v rámci svazku

September

Stát vydavatele periodika

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

Počet stran výsledku

10

Strana od-do

106-115

Kód UT WoS článku

000862840900010

EID výsledku v databázi Scopus

2-s2.0-85134812176