A problem in arrangements
From MaRDI portal
Publication:4758850
DOI10.1090/S0002-9904-1934-05988-3zbMath0010.28901WikidataQ55951861 ScholiaQ55951861MaRDI QIDQ4758850
Publication date: 1934
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items (29)
Initial non-repetitive complexity of infinite words ⋮ A normal sequence compressed by PPM* but not by Lempel-Ziv 78 ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ De-Bruijn sequences and magic ⋮ Mapping prefer-opposite to prefer-one de Bruijn sequences ⋮ Computing generalized de Bruijn sequences ⋮ A relation between sequences generated by Golomb's preference algorithm ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Constructing the first (and coolest) fixed-content universal cycle ⋮ A tight upper bound on the length of maximal bordered box repetition-free words ⋮ Spans of preference functions for de Bruijn sequences ⋮ On a Greedy Algorithm to Construct Universal Cycles for Permutations ⋮ Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions ⋮ The coolest way to generate binary strings ⋮ Growing perfect cubes ⋮ A surprisingly simple de Bruijn sequence construction ⋮ The discrepancy of the lex-least de Bruijn sequence ⋮ Universal cycles for combinatorial structures ⋮ DE BRUIJN SEQUENCES REVISITED ⋮ A class of nonlinear de Bruijn cycles ⋮ Test sequence construction using minimum information on the tested system ⋮ Lexicographic compositions and de Bruijn sequences ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ On greedy algorithms for binary de Bruijn sequences ⋮ Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
This page was built for publication: A problem in arrangements
