Pages that link to "Item:Q5204304"
From MaRDI portal
The following pages link to Abelian squares are avoidable on 4 letters (Q5204304):
Displaying 50 items.
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- New second-preimage attacks on hash functions (Q321303) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Infinite ternary square-free words concatenated from permutations of a single word (Q390906) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- Relations on words (Q505060) (← links)
- An abelian periodicity lemma (Q507407) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- The number of binary words avoiding Abelian fourth powers grows exponentially (Q596075) (← links)
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- On Abelian squares and substitutions (Q1292481) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Anagram-free colorings of graphs (Q1689991) (← links)
- New second preimage attacks on dithered hash functions with low memory complexity (Q1698640) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Maximal abelian square-free words of short length. (Q1873826) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Mesosome avoidance (Q2094370) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- \(2\times n\) grids have unbounded anagram-free chromatic number (Q2170797) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Long binary patterns are abelian 2-avoidable (Q2378523) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- Anagram-Free Colourings of Graphs (Q3177364) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
