The following pages link to A problem in arrangements (Q4758850):
Displaying 19 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Spans of preference functions for de Bruijn sequences (Q423901) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- Longest subsequences shared by two de Bruijn sequences (Q780381) (← links)
- A normal sequence compressed by PPM* but not by Lempel-Ziv 78 (Q831838) (← links)
- Growing perfect cubes (Q941376) (← links)
- The discrepancy of the lex-least de Bruijn sequence (Q966010) (← links)
- Universal cycles of \((n - 1)\)-partitions of an \(n\)-set (Q1044896) (← links)
- Universal cycles for combinatorial structures (Q1208348) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Lexicographic compositions and de Bruijn sequences (Q1232525) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Mapping prefer-opposite to prefer-one de Bruijn sequences (Q1675290) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
