2000 character limit reached
Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences
Published 10 Aug 2010 in math.CO and cs.DM | (1008.1608v1)
Abstract: A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. Application to the construction of short 2-radius sequences is given, with some new 2-radius sequences found through computer search.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.