Packing analogue of \(k\)-radius sequences

DOI10.1016/j.ejc.2016.04.004zbMath1339.05008OpenAlexW2345613294MaRDI QIDQ298335

Zbigniew Lonc, Miroslaw Truszczynski

Publication date: 20 June 2016

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

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

zbMATH Keywords

packing \(k\)-radius sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)

Related Items (3)

Achromatic and Harmonious Colorings of Circulant Graphs ⋮ Note on a construction of short \(k\)-radius sequences ⋮ Robust Positioning Patterns with Low Redundancy

Cites Work

• Unnamed Item
• Unnamed Item
• The existence of \(k\)-radius sequences
• Constructions of asymptotically shortest \(k\)-radius sequences
• Universal cycles of \(k\)-subsets and \(k\)-permutations
• Sequences of large radius
• Universal cycles for combinatorial structures
• Solution of an outstanding conjecture: the non-existence of universal cycles with \(k=n-2\)
• The Difference Between Consecutive Primes, II
• Constructing 𝑘-radius sequences
• Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
• Near-Universal Cycles for Subsets Exist
• On Universal Cycles for k-Subsets of an n-Set
• Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations

This page was built for publication: Packing analogue of \(k\)-radius sequences