Factor frequencies in languages invariant under symmetries preserving factor frequencies,

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F12%3A00196413" target="_blank" >RIV/68407700:21340/12:00196413 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Factor frequencies in languages invariant under symmetries preserving factor frequencies,

Original language description

The number of frequencies of factors of length n+ 1 in a recurrent aperiodic infinite word does not exceed 3?C(n), where ?C(n) is the first difference of factor complexity, as shown by Boshernitzan. Pelantov´a together with the author derived a better upper bound for infinite words whose language is closed under reversal. In this paper, we further diminish the upper bound for uniformly recurrent infinite words whose language is invariant under all elements of a finite group of symmetries and we prove the optimality of the obtained upper bound.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F09%2F0584" target="_blank" >GA201/09/0584: Algebraic and combinatorial aspects of aperiodic structures</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2012

Confidentiality

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

Name of the periodical

Integers: Electronic Journal of Combinatorial Number Theory

ISSN

1553-1732

e-ISSN

—

Volume of the periodical

12

Issue of the periodical within the volume

—

Country of publishing house

US - UNITED STATES

Number of pages

13

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—