A problem in arrangements

Cited in

(40)

Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
Universal cycles for combinatorial structures
A class of nonlinear de Bruijn cycles
Lexicographic compositions and de Bruijn sequences
Constructing de Bruijn sequences by concatenating smaller universal cycles
Mapping prefer-opposite to prefer-one de Bruijn sequences
Computing generalized de Bruijn sequences
A framework for constructing de Bruijn sequences via simple successor rules
On greedy algorithms for binary de Bruijn sequences
Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions
An efficient generalized shift-rule for the prefer-max de Bruijn sequence
Test sequence construction using minimum information on the tested system
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
De-Bruijn sequences and magic
A relation between sequences generated by Golomb's preference algorithm
Initial non-repetitive complexity of infinite words
The lexicographically smallest universal cycle for binary strings with minimum specified weight
Spans of preference functions for de Bruijn sequences
The coolest way to generate binary strings
DE BRUIJN SEQUENCES REVISITED
A surprisingly simple de Bruijn sequence construction
On a greedy algorithm to construct universal cycles for permutations
Constructing the first (and coolest) fixed-content universal cycle
A tight upper bound on the length of maximal bordered box repetition-free words
On prefer-one sequences
Matching patterns with variables under Simon's congruence
On a family of universal cycles for multi-dimensional permutations
New successor rules to efficiently produce exponentially many binary de Bruijn sequences
k-universality of regular languages
De Bruijn sequences: from games to shift-rules to a proof of the Fredricksen-Kessler-Maiorana theorem
The edit distance to k-subsequence universality
\(k\)-universality of regular languages
Maximize the rightmost digit: Gray codes for restricted growth strings
The edit distance to \(k\)-subsequence universality
A simple shift rule for \(k\)-ary de Bruijn sequences
Yamatárájabhánasalagám (the rhythm of de Bruijn's successions)
Longest subsequences shared by two de Bruijn sequences
A normal sequence compressed by PPM* but not by Lempel-Ziv 78
Growing perfect cubes
The discrepancy of the lex-least de Bruijn sequence

This page was built for publication: A problem in arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4758850)