The following pages link to (Q5306171):
Displaying 20 items.
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Clusters of repetition roots: single chains (Q831839) (← links)
- Partial words with a unique position starting a square (Q1730024) (← links)
- Clusters of repetition roots forming prefix chains (Q2112177) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- Squares in partial words (Q2440165) (← links)
- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (Q2921985) (← links)
- Balance Properties and Distribution of Squares in Circular Words (Q3533036) (← links)
- BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS (Q3586409) (← links)
- (Q4907314) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- On the number of squares in partial words (Q5190081) (← links)
- Number of Words Characterizing Digital Balls on the Triangular Tiling (Q5739383) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5920146) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)