Events2Join

On Universal Cycles for new Classes of Combinatorial Structures


On Universal Cycles for new Classes of Combinatorial Structures

Title:On Universal Cycles for new Classes of Combinatorial Structures ... Abstract:A universal cycle (u-cycle) is a compact listing of a ...

On Universal Cycles for new Classes of Combinatorial Structures

Abstract. A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this paper, we use natural encodings of these objects to ...

On universal cycles for new classes of combinatorial structures ...

A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this paper, we use natural encodings of these objects to show ...

On Universal Cycles for new Classes of Combinatorial Structures

ON UNIVERSAL CYCLES FOR NEW CLASSES OF. COMBINATORIAL STRUCTURES. ∗. ANTONIO BLANCA† AND ANANT P. GODBOLE‡. Abstract. A universal cycle (u-cycle) is a compact ...

Universal cycles for combinatorial structures - ScienceDirect.com

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

On Universal Cycles for new Classes of Combinatorial Structures

In this paper, we use natural encodings of these objects to show the existence of u-cycles for collections of subsets, restricted multisets, and lattice paths.

Universal Cycles for Some Combinatorial Objects

Blanca and A. P. Godbole (2011). “On Universal Cycles for New Classes of. Combinatorial Structures,” SIAM J. Discrete Math. 25, 1832-1842 ...

Universal cycles for combinatorial structures - UCSD Math

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

Graph universal cycles of combinatorial objects - ScienceDirect.com

References (15) · Discrete Math. (2009) · A. Blanca et al. On universal cycles for new classes of combinatorial structures · G. Brockman et al. On universal ...

Universal cycles for combinatorial structures | Discrete Mathematics

Universal cycles for combinatorial structures · Contents. Discrete Mathematics. Volume 110, Issue 1-3 · PREVIOUS ARTICLE. Further results on large sets of ...

De Bruijn Sequence and Universal Cycle Constructions

[BG11] A. Blanca and A. P. Godbole. On universal cycles for new classes of combinatorial structures. SIAM Journal on Discrete Mathematics, 25(4):1832–1842, 2011 ...

Graph universal cycles of combinatorial objects - NSF PAR

In general, the insertion of the new element must be done in a way that respects the inversion structure of the starting vertex if one is to exploit the ...

Universal cycles for combinatorial structures | Semantic Scholar

Semantic Scholar extracted view of "Universal cycles for combinatorial structures" by F. C. Graham et al.

Novel universal cycle constructions for a variety of combinatorial ...

On universal cycles for new classes of combinatorial structures. SIAM J. Discret. Math., 25(4):1832–1842, Dec. 2011. [8] A. Bogdanov. Cryptanalysis of the ...

On a Greedy Algorithm to Construct Universal Cycles for Permutations

A universal cycle, or u-cycle, for a class of combinatorial objects is a cyclic ... steps of the algorithm when we are forced to use new letters, so the total.

On Universal Cycles for Multisets

Ucycle has come to refer to a Universal Cycle for t-subsets of [n]. Universal. Cycles for a wide range of combinatorial structures were ...

(PDF) Universal Cycles of Complementary Classes | Anant Godbole ...

Godbole (2011), “On Universal cycles for new classes of combinatorial structures,” SIAM J. Discrete Math. 25, 1832–1842. [4] A. Leitner and A. Godbole (2010) ...

Universal cycles for permutation classes

Given a family C of combinatorial objects that can be represented as sequences of length n, a universal cycle for such a family is a sequence, whose length n ...

Graph Universal Cycles of Combinatorial Objects - ResearchGate

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 ...

Compression and Connections to Universal Cycles - arXiv

a few different kinds of gupwords for permutation graphs along with new kinds of shortened universal words ... Universal cycles for combinatorial ...