Universal Cycles of Discrete Functions

MaRDI QIDQ3616008zbMATH OpenFDO

Authors Britni Labounty-Lay, Ashley Bechel, Anant P. Godbole

Publication date 24 March 2009

Full work available at URL https://arxiv.org/abs/0805.1672

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Abstract: A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as deBruijn cycles or $U$-cycles) of several combinatorial objects. We present new results on the existence of universal cycles of certain classes of functions. These include onto functions, and 1-inequitable sequences on a binary alphabet. In each case the connectedness of the underlying graph is the non-trivial aspect to be established.

Recommendations

• Universal sequences of functions
• Universal cycles for permutations
• On discrete universality of composite functions
• scientific article; zbMATH DE number 3997875
• Universal cycles for combinatorial structures
• Universal cycles for permutation classes
• Publication:5753777
• Universal cycles of complementary classes
• Universal cycles for weak orders
• Cyclic iterated function systems

Cited in

(6)

• Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
• The lexicographically smallest universal cycle for binary strings with minimum specified weight
• Universal cycles of restriced words
• Binary bubble languages and cool-lex order
• Universal cycles of classes of restricted words
• Universal and near-universal cycles of set partitions

This page was built for publication: Universal Cycles of Discrete Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616008)