Fewest repetitions in infinite binary words (Q2911423): Difference between revisions

@@ Property / arXiv ID @@
+.5723
@@ Property / arXiv ID: 1207.5723 / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of Dejean’s conjecture
@@ Property / cites work: A proof of Dejean’s conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Sur un théorème de Thue
@@ Property / cites work: Sur un théorème de Thue / rank @@
+Normal rank
@@ Property / cites work @@
+How many squares must a binary sequence contain?
@@ Property / cites work: How many squares must a binary sequence contain? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396590
@@ Property / cites work: Q3396590 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial versus exponential growth in repetition-free binary words
+Normal rank
@@ Property / cites work @@
+Q4341774
@@ Property / cites work: Q4341774 / rank @@
+Normal rank
@@ Property / cites work @@
+Avoiding large squares in infinite binary words
@@ Property / cites work: Avoiding large squares in infinite binary words / rank @@
+Normal rank
@@ Property / cites work @@
+Last cases of Dejean's conjecture
@@ Property / cites work: Last cases of Dejean's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
+Normal rank