Palindromic sequences generated from marked morphisms

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F16%3A00238788" target="_blank" >RIV/68407700:21340/16:00238788 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Palindromic sequences generated from marked morphisms

Popis výsledku v původním jazyce

Fixed points u = phi(u) of marked and primitive morphisms phi over arbitrary alphabet are considered. We show that if u is palindromic, i.e., its language contains infinitely many palindromes, then some power of phi has a conjugate in class P. This class was introduced by Hof et al. (1995) in order to study palindromic morphic words. Our definitions of marked and well-marked morphisms are more general than the ones previously used by Frid (1999) or Tan (2007). As any morphism with an aperiodic fixed point over a binary alphabet is marked, our result generalizes the result of Tan. Labbe (2014) demonstrated that already over a ternary alphabet the property of morphisms to be marked is important for the validity of our theorem. The main tool used in our proof is the description of bispecial factors in fixed points of morphisms provided by Klouda (2012). (C) 2015 Elsevier Ltd. All rights reserved.

Název v anglickém jazyce

Palindromic sequences generated from marked morphisms

Popis výsledku anglicky

Fixed points u = phi(u) of marked and primitive morphisms phi over arbitrary alphabet are considered. We show that if u is palindromic, i.e., its language contains infinitely many palindromes, then some power of phi has a conjugate in class P. This class was introduced by Hof et al. (1995) in order to study palindromic morphic words. Our definitions of marked and well-marked morphisms are more general than the ones previously used by Frid (1999) or Tan (2007). As any morphism with an aperiodic fixed point over a binary alphabet is marked, our result generalizes the result of Tan. Labbe (2014) demonstrated that already over a ternary alphabet the property of morphisms to be marked is important for the validity of our theorem. The main tool used in our proof is the description of bispecial factors in fixed points of morphisms provided by Klouda (2012). (C) 2015 Elsevier Ltd. All rights reserved.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-03538S" target="_blank" >GA13-03538S: Algoritmy, dynamika a geometrie numeračních systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2016

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

—

Svazek periodika

51

Číslo periodika v rámci svazku

January

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

15

Strana od-do

200-214

Kód UT WoS článku

000362144400013

EID výsledku v databázi Scopus

2-s2.0-84934882110