Some further results on squarefree arithmetic progressions in infinite words
| Autor: | Tero Harju, Narad Rampersad, Pascal Ochem, James D. Currie |
|---|---|
| Přispěvatelé: | Department of Mathematics and Statistics [Winipeg], University of Winnipeg, Turku Centre for Computer Science, University of Turku, Algorithmes, Graphes et Combinatoire (ALGCO), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), David R. Cheriton School of Computer Science, University of Waterloo [Waterloo] |
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
General Computer Science Formal Languages and Automata Theory (cs.FL) Existential quantification Computer Science - Formal Languages and Automata Theory 0102 computer and information sciences 02 engineering and technology Square-free integer 68R15 [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] 01 natural sciences Square (algebra) Theoretical Computer Science 010201 computation theory & mathematics Subsequence 0202 electrical engineering electronic engineering information engineering FOS: Mathematics Mathematics - Combinatorics 020201 artificial intelligence & image processing Combinatorics (math.CO) Alphabet Arithmetic Ternary operation Word (group theory) Mathematics |
| Zdroj: | Theoretical Computer Science Theoretical Computer Science, Elsevier, 2019, 799, pp.140-148. ⟨10.1016/j.tcs.2019.10.006⟩ |
| ISSN: | 1879-2294 0304-3975 |
| DOI: | 10.48550/arxiv.1901.06351 |
| Popis: | In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results. Comment: 13 pages, 2 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect