The following pages link to James D. Currie (Q405074):
Displaying 50 items.
- (Q252852) (redirect page) (← links)
- Avoidability index for binary patterns with reversal (Q252854) (← links)
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- Infinite ternary square-free words concatenated from permutations of a single word (Q390906) (← links)
- Square-free words with square-free self-shuffles (Q405075) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- Recurrent words with constant abelian complexity (Q544139) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- The number of binary words avoiding Abelian fourth powers grows exponentially (Q596075) (← links)
- Lexicographically least words in the orbit closure of the Rudin-Shapiro word (Q638548) (← links)
- Binary words containing infinitely many overlaps (Q869996) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- Palindrome positions in ternary square-free words (Q924154) (← links)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- A cyclic binary morphism avoiding abelian fourth powers (Q1001897) (← links)
- For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \) (Q1010692) (← links)
- (Q1182059) (redirect page) (← links)
- The number of order-preserving maps of fences and crowns (Q1182061) (← links)
- Connectivity of distance graphs (Q1196753) (← links)
- Extremal infinite overlap-free binary words (Q1386332) (← links)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694) (← links)
- There exist binary circular \(5/2^+\) power free words of every length (Q1422153) (← links)
- A word on 7 letters which is non-repetitive up to mod 5 (Q1424355) (← links)
- Non-repetitive tilings (Q1605623) (← links)
- Avoidance bases for formulas with reversal (Q1643149) (← links)
- Unary patterns under permutations (Q1659986) (← links)
- The Thue-Morse word contains circular \(5/2^+\) power free words of every length (Q1770411) (← links)
- Counting endomorphisms of crown-like orders (Q1810802) (← links)
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 (Q1856341) (← links)
- No iterated morphism generates any arshon sequence of odd order (Q1861221) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- A note on antichains of words (Q1909962) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 (Q2216428) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- The undirected repetition threshold (Q2333037) (← links)
- Some further results on squarefree arithmetic progressions in infinite words (Q2333815) (← links)
- Long binary patterns are abelian 2-avoidable (Q2378523) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- Extremal words in morphic subshifts (Q2436834) (← links)
- Attainable lengths for circular binary words avoiding \(k\) powers (Q2475529) (← links)
- The fixing block method in combinatorics on words (Q2494421) (← links)
- Which graphs allow infinite nonrepetitive walks? (Q2639070) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- (Q2768132) (← links)
- UNARY PATTERNS WITH INVOLUTION (Q2841974) (← links)
- Suffix Conjugates for a Class of Morphic Subshifts (Q2849980) (← links)
