The following pages link to Harold Fredricksen (Q754868):
Displaying 24 items.
- Schur numbers and the Ramsey numbers N(3,3,\dots ,3;2) (Q754869) (← links)
- An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
- Covering the de Bruijn graph (Q1176741) (← links)
- A new look at the de Bruijn graph (Q1199424) (← links)
- A class of nonlinear de Bruijn cycles (Q1219284) (← links)
- Lexicographic compositions and de Bruijn sequences (Q1232525) (← links)
- Necklaces of beads in k colors and k-ary de Bruijn sequences (Q1248514) (← links)
- Symmetric sum-free partitions and lower bounds for Schur numbers (Q1569275) (← links)
- Generation of the Ford sequence of length \(2^ n\), n large (Q2550021) (← links)
- (Q3470412) (← links)
- A Generalization of Swan's Theorem (Q3710607) (← links)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms (Q3940837) (← links)
- (Q4016807) (← links)
- (Q4083520) (← links)
- (Q4088828) (← links)
- The number of nonlinear shift registers that produce all vectors of weight >or=t (Q4307480) (← links)
- (Q4770466) (← links)
- (Q5284006) (← links)
- (Q5442547) (← links)
- Remarks on a Sequence of Minimal Niven Numbers (Q5448570) (← links)
- Minimal Niven numbers (Q5458414) (← links)
- The Cyclotomic Numbers of Order Eighteen with Applications to Difference Sets (Q5535016) (← links)
- The lexicographically least de Bruijn cycle (Q5597538) (← links)
- Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.) (Q5598191) (← links)
