<div class="csl-bib-body">
<div class="csl-entry">Konieczny, J., & Müllner, C. (2024). <i>Arithmetical subword complexity of automatic sequences</i>. arXiv. https://doi.org/10.48550/arXiv.2309.03180</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/210151
-
dc.description.abstract
We fully classify automatic sequences a over a finite alphabet Ω with the property that each word over Ω appears is a along an arithmetic progression. Using the terminology introduced by Avgustinovich, Fon-Der-Flaass and Frid, these are the automatic sequences with the maximal possible arithmetical subword complexity. More generally, we obtain an asymptotic formula for arithmetical (and even polynomial) subword complexity of a given automatic sequence a.
en
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.language.iso
en
-
dc.subject
Automatic sequences
en
dc.subject
subword complexity
en
dc.title
Arithmetical subword complexity of automatic sequences
en
dc.type
Preprint
en
dc.type
Preprint
de
dc.identifier.arxiv
2309.03180
-
dc.contributor.affiliation
Université Claude Bernard Lyon 1, France
-
dc.relation.grantno
I 4945-N
-
tuw.project.title
Arithmetische Zufälligkeit
-
tuw.researchTopic.id
A3
-
tuw.researchTopic.name
Fundamental Mathematics Research
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E104-05 - Forschungsbereich Kombinatorik und Algorithmen
-
tuw.publisher.doi
10.48550/arXiv.2309.03180
-
dc.description.numberOfPages
14
-
tuw.author.orcid
0000-0003-4119-8570
-
tuw.author.orcid
0000-0002-2984-6005
-
dc.description.sponsorshipexternal
French National Research Agency (ANR)
-
dc.relation.grantnoexternal
ANR-11-IDEX-0007
-
tuw.publisher.server
arXiv
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
5
-
wb.sciencebranch.value
95
-
item.languageiso639-1
en
-
item.openairetype
preprint
-
item.grantfulltext
restricted
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_816b
-
crisitem.author.dept
Université Claude Bernard Lyon 1
-
crisitem.author.dept
E104-05 - Forschungsbereich Kombinatorik und Algorithmen
-
crisitem.author.orcid
0000-0003-4119-8570
-
crisitem.author.orcid
0000-0002-2984-6005
-
crisitem.author.parentorg
E104 - Institut für Diskrete Mathematik und Geometrie
