Sequences of large radius

DOI10.1016/J.EJC.2014.04.005zbMath1314.68249OpenAlexW2047433509MaRDI QIDQ740274

Zbigniew Lonc, Michał Dębski

Publication date: 2 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.04.005

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (6)

Packing analogue of \(k\)-radius sequences ⋮ Sequences of Radius k for Complete Bipartite Graphs ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Sequences of radius \(k\) for complete bipartite graphs ⋮ Constructing Optimal $k$-Radius Sequences ⋮ Note on a construction of short \(k\)-radius sequences

Cites Work

• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Consecutive storage of relevant records with redundancy
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
• Unnamed Item

This page was built for publication: Sequences of large radius