On non-repetitive sequences of arithmetic progressions: The cases
Authors:
- Borut LužarBLBorut Lužar
- Martina MockovčiakováMMMartina Mockovčiaková
- Pascal OchemPOPascal Ochem
- Alexandre PinlouAPAlexandre Pinlou
- Roman SotákRSRoman Soták
- 1 May 2020
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 279, 106-117
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Slovenian Research Agency Program (P1–0383)
- joint Austrian–Slovenian project (N1-0057)
- Czech Science Foundation (GA17–04611S)
- Czech Ministry of Education, Youth and Sports (LO1506)
- ANR project CoCoGro (ANR-16-CE40-0005)
- Slovak Research and Development Agency (APVV–15–0116)
- Science Grant Agency, Slovakia (VEGA 1/0368/16)
This publication has 10 references indexed in Scilit:
- On a Generalization of Thue SequencesThe Electronic Journal of Combinatorics, 2015
- Nonrepetitive Sequences on Arithmetic ProgressionsThe Electronic Journal of Combinatorics, 2011
- The origins of combinatorics on wordsEuropean Journal of Combinatorics, 2007
- The Fixing Block Method in Combinatorics on WordsCombinatorica, 2003
- A word on 7 letters which is non-repetitive up to mod 5Acta Informatica, 2003
- Thue-like Sequences and Rainbow Arithmetic ProgressionsThe Electronic Journal of Combinatorics, 2002
- Non-Repetitive TilingsThe Electronic Journal of Combinatorics, 2002
- On combinatorial properties of the Arshon sequenceDiscrete Applied Mathematics, 2001
- Which graphs allow infinite nonrepetitive walks?Discrete Mathematics, 1991
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972