✦ LIBER ✦

Universal cycles for combinatorial structures

✍ Scribed by Fan Chung; Persi Diaconis; Ron Graham

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 836 KB
Volume: 110
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90699-g

No coin nor oath required. For personal study only.

✦ Synopsis

Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59

In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite set.

📜 SIMILAR VOLUMES

Equivalence class universal cycles for p

Equivalence class universal cycles for permutations

✍ Glenn Hurlbert; Garth Isaak 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 268 KB

We construct a universal cycle of n-permutations using n + 1 symbols and an equivalence relation based on differences. Moreover a complete family of universal cycles of this kind is constructed.

Universal traversal sequences for paths

Universal traversal sequences for paths and cycles

✍ Michael F Bridgland 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Combinatorial Models for Coalgebraic Str

Combinatorial Models for Coalgebraic Structures

✍ Nigel Ray; William Schmitt 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 624 KB

We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras, and co

Unit subduced cycle indices for combinat

Unit subduced cycle indices for combinatorial enumeration

✍ Shinsaku Fujita 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 802 KB

## Abstract Combinatorial enumeration by means of unit subduced cycle indices (USCIs) is discussed by using the group I (__A__~5~) and the related groups as examples. A modified method for the derivation of USCIs is presented, where a subduced mark table is a key concept. Several properties of USCI

Computer Algebra Libraries for Combinato

Computer Algebra Libraries for Combinatorial Structures

✍ Philippe Flajolet; Bruno Salvy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 652 KB

This paper introduces the framework of decomposable combinatorial structures and their traversal algorithms. A combinatorial type is decomposable if it admits a specification in terms of unions, products, sequences, sets, and cycles, either in the labelled or in the unlabelled context. Many properti

Universal similarity measure for compari

✍ Marcos R. Betancourt; Jeffrey Skolnick 📂 Article 📅 2001 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 79 KB

We introduce a new variant of the root mean square distance (RMSD) for comparing protein structures whose range of values is independent of protein size. This new dimensionless measure (relative RMSD, or RRMSD) is zero between identical structures and one between structures that are as globally diss