Thue type problems for graphs, points, and numbers

Discrete Mathematics

Volumn 308, Issue 19, 2008, Pages 4419-4429

  Grytczuk, Jarosław ^a,b  

^a JAGIELLONIAN UNIVERSITY   (Poland)

^b State Higher Vocational School in Nowy Sacz   (Poland)

Author keywords

Avoidable pattern; Graph coloring; Nonrepetitive sequence

Indexed keywords

MICROFLUIDICS;

EID: 45249083197     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.08.039     Document Type: Article

References (69)

1. L. Addario-Berry, K. Dalal, B.A. Reed, Degree constrained subgraphs, Discrete Appl. Math. (to appear).
2. J.-P. Allouche, J. Shallit, The ubiquitous Prouhet-Thue-Morse Sequence. Sequences and their Applications (Singapore, 1998), Springer Series in Discrete Mathematics and Theoretical Computer Science, Springer, London, 1999, pp. 1-16.
3. Allouche J.-P., and Shallit J. Automatic Sequences. Theory, Applications, Generalizations (2003), Cambridge University Press, Cambridge
4. N. Alon, J. Grytczuk, Power-free colorings of graphs, manuscript.
5. Alon N., Grytczuk J., Hałuszczak M., and Riordan O. Non-repetitive colorings of graphs. Random Struct. Algor. 21 (2002) 336-346
6. Alon N., and Spencer J.H. The Probabilistic Method. second ed. (2000), Wiley, New York
7. Arszon E.S. Proof of the existence of n-valued infinite asymmetric sequences. Mat. Sb. 2 44 (1939) 769-779 (in Russian)
8. Baker K.A., McNulty G.F., and Taylor W. Growth problems for avoidable words. Theoret. Comput. Sci. 69 (1989) 319-345
9. Bean D.R., Ehrenfeucht A., and McNulty G.F. Avoidable patterns in strings of symbols. Pacific J. Math. 85 (1979) 261-294
10. J. Beck, An application of Lovász local lemma: there exists an infinite 01-sequence containing no near identical intervals, in: Finite and Infinite Sets, Eger 1981, Colloquia Mathematica Societatis János Bolyai, 1983, pp. 103-107.
11. Berstel J. Axel Thue's work on repetitions in words. In: Leroux P., and Reutenauer C. (Eds). Séries formelles et combinatoire algébrique Publications du LaCIM (1992), Université du Québec a Montréal 65-80
12. Berstel J. Axel Thue's papers on repetitions in words: a translation, Publications du LaCIM vol. 20 (1995), Université du Québec a Montréal
13. Berstel J., and Karhumäki J. Combinatorics on words-a tutorial. Bull. Eur. Assoc. Theoret. Comput. Sci. EATCS 79 (2003) 178-228
14. Bott R. Marston Morse and his mathematical works. Bull. Amer. Math. Soc. (New Series) 3 (1980) 907-950
15. Brešar B., and Klavžar S. Square-free colorings of graphs. Ars Combin. 70 (2004) 3-13
16. Brown T.C. Is there a sequence on four symbols in which no two adjacent segments are permutations of one another?. Amer. Math. Monthly 78 (1971) 886-888
17. Carpi A. Multidimensional unrepetitive configurations. Theoret. Comput. Sci. 56 (1988) 233-241
18. Choffrut C., and Karhumäki J. Combinatorics of words. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages (1997), Springer, Berlin, Heidelberg 329-438
19. R.J. Clark, Avoidable formulas in combinatorics on words, Ph.D. Thesis, University of California, Los Angeles, 2001.
20. J.D. Currie, Non-repetitive walks in graphs and digraphs, Ph.D. Thesis, University of Calgary, Alberta, Canada, 1987.
21. Currie J.D. Which graphs allow infinite nonrepetitive walks?. Discrete Math. 87 3 (1991) 249-260
22. Currie J.D. Open problems in pattern avoidance. Amer. Math. Monthly 100 (1993) 790-793
23. Currie J.D. There are ternary circular square-free words of length n for n ≥ 18. Electron. J. Combin. 9 10 (2002) 7
24. J.D. Currie, D.S. Fitzpatrick, Circular words avoiding patterns, in: Developments in Language Theory, Lecture Notes in Computer Science, vol. 2450, Springer, Berlin, 2003, pp. 319-325.
25. Currie J.D., and Moodie E. A word on 7 letters which is non-repetitive up to mod5. Acta Inform. 39 6-7 (2003) 451-468
26. Currie J.D., and Simpson J. Non-repetitive tilings. Electron. J. Combin. 9 (2002)
27. Dejean F. Sur un théoreme de Thue. J. Combin. Theory Ser. A 13 (1972) 90-99
28. Dekking F.M. Strongly non-repetitive sequences and progression free sets. J. Combin. Theory Ser. A 27 (1979) 181-185
29. A. Dumitrescu, R. Radoicic, On a coloring problem for the integer grid, in: Towards a Theory of Geometric Graphs, vol. 342, Contemporary Mathematics, AMS, Providence, RI, 2004, pp. 67-74.
30. Erdo{combining double acute accent}s P. Note on products of consecutive integers. J. London Math. Soc. 14 (1939) 194-198
31. Erdo{combining double acute accent}s P. Some unsolved problems. Magyar Tud. Akad. Mat. Kutato. Int. Kozl. 6 (1961) 221-254
32. Erdo{combining double acute accent}s P., and Nešetřil J. Problem. In: Halász G., and Sós V.T. (Eds). Irregularities of Partitions (Papers from the meeting held in Fertöd, July 7-11, 1986), Algorithms and Combinatorics: Study and Research Texts vol. 8 (1989), Springer, Berlin 162-163
33. Erdo{combining double acute accent}s P., and Selfridge J.L. The product of consecutive integers is never a power. Illinois J. Math. 19 (1975) 292-301
34. Evdokimov A.A. Strongly asymmetric sequences generated by finite number of symbols. Dokl. Akad. Nauk. SSSR 179 (1968) 1268-1271 Soviet Math. Dokl. 9 (1968) 536-539
35. Gelfond A.O. Sur les nombres qui ont des propriétés additives et multiplicatives données. Acta Arith. 13 (1967/1968) 259-265
36. Gottschalk W.H., and Hedlund G.A. A characterization of the Morse minimal set. Proc. Amer. Math. Soc. 15 (1964) 70-74
37. Grytczuk J. Pattern avoiding colorings of Euclidean spaces. Ars Combin. 64 (2002) 109-116
38. Grytczuk J. Thue-like sequences and rainbow arithmetic progressions. Electron. J. Combin. 9 (2002)
39. Grytczuk J., and Śliwa W. Non-repetitive colorings of infinite sets. Discrete Math. 265 (2003) 365-373
40. Guy R.K. Unsolved Problems in Number Theory. second ed. (1994), Springer, New York
41. Halbeisen L., and Hungerbühler N. An application of van der Waerden's theorem in additive number theory. Integers: Electr. J. Combin. Numer. Theory (2000)
42. Karoński M., Łuczak T., and Thomason A. Edge weights and vertex colours. J. Combin. Theory Ser. B 91 (2004) 151-157
43. V. Keränen, Abelian squares are avoidable on 4 letters, Automata, Languages and Programming: Lecture Notes in Computer science, vol. 623, Springer, Berlin, 1992, pp. 41-52.
44. Kostrikin A.I. Around Burnside (1986), "Nauka", Moscow
45. A. Kündgen, M.J. Pelsmajer, Nonrepetitive colorings of graphs of bounded tree-width, Discrete Math., in press, doi:10.1016/j.disc.2007.08.043.
46. Langevin M. Sur quelques conséquences de la conjecture abc en arithmétique et en logique. Symposium on Diophantine Problems (Boulder, CO, 1994). Rocky Mountain J. Math. 26 3 (1996) 1031-1042
47. Lothaire M. Combinatorics on Words (1983), Addison-Wesley, Reading, MA
48. M. Lothaire, Algebraic Combinatoric on Words, Cambridge, 2001.
49. Mauduit C. Multiplicative properties of the Thue-Morse sequence. Period. Math. Hungar. 43 (2001) 137-153
50. Mignosi F. Infinite words with linear subword complexity. Theoret. Comput. Sci. 82 (1989) 221-242
51. Molloy M., and Reed B. A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B 69 2 (1997) 103-109
52. Molloy M., and Reed B. Graph Colouring and the Probabilistic Method, Algorithms and Combinatorics vol. 23 (2002), Springer, Berlin
53. Morse M. A one-to-one representation of geodesics on a surface of negative curvature. Amer. J. Math. 43 (1921) 35-51
54. Morse M., and Hedlund G. Unending chess, symbolic dynamics, and a problem in semigroups. Duke Math. J. 11 (1944) 1-7
55. Narkiewicz W. Classical Problems in Number Theory (1986), Monografie Matematyczne, PWN Warszawa
56. Novikov P.S. On periodic groups. Dokl. Akad. Nauk SSSR 127 (1959) 749-752
57. Novikov P.S., and Adjan S.I. On infinite periodic groups I, II, III. Math. USSR Izv. 32 (1968) 212-244 251-524, 709-731
58. Ollagnier M.J. Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters. Theoret. Comput. Sci. 95 (1992) 187-205
59. Pirillo G., and Varricchio S. On uniformly repetitive semigroups. Semigroup Forum 49 1 (1994) 125-129
60. Pleasants P.A.B. Non-repetitive sequences. Proc. Cambridge Philos. Soc. 68 (1970) 267-274
61. Prouhet E. Memoire sur quelques relations entre les puissances des nombres. C. R. Acad. Sci. Paris 33 (1851) 31
62. O. Rigge, Über ein diophantisches Problem, in: IX Scandinavian Congress of Mathematicians, 1939, pp. 155-160.
63. Robertson N., and Seymour P.D. Graph minors V: excluding a planar graph. J. Combin. Theory Ser. B 41 (1986) 92-114
64. Rosenblatt J. The sequence of greatest integers of an arithmetic progression. J. London Math. Soc. (2) 17 (1978) 213-218
65. M.V. Sapir, Combinatorics on Words with Applications, Birkhäuser (to appear).
66. Shallit J. Real numbers with bounded partial quotients: a survey. Enseign. Math. (2) 38 1-2 (1992) 151-187
67. Thue A. Über unendliche Zeichenreichen. Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania 7 (1906) 1-22
68. Thue A. Über die gegenseitigen Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania 1 (1912) 1-67
69. Zimin A.I. Blocking sets of terms. Mat. Sb. (N.S.) 119 (1982) 363-375