On Universal Cycles for new Classes of Combinatorial Structures

We then apply the related concept of a graph universal cycle (GU-cycle) to combinatorial objects that cannot be U-cycled, and ultimately ...

Random Generation of Combinatorial Structures from a Uniform ...

We show that the existence of a polynomial time bounded PTM for uniformly generating cycles in a directed graph would imply that NP = RP. (RP is the class of ...

A calculus for the random generation of labelled combinatorial ...

A class of structures like H, that admits an equational specification, like ... We start with a specification where all composite types (sequences, sets, cycles) ...

Universal cycles for permutations - CORE

For all 2 ≤ k ≤ n−1, we take a new copy of Tn and modify it as follows. ... Graham, Universal cycles for combinatorial structures, Discrete Math.

Overlap Cycles for Steiner Quadruple Systems - Wiley Online Library

2F. Chung, P. Diaconis, and R. Graham, Universal Cycles for Combinatorial Structures, Discrete Math 110 (1992), 43–59. ... 3M. B. Cohen and C. J. ...

Combinatorial Optimization of Cycles and Bases - Jeff Erickson

Combinatorial surfaces. For problems related to homotopy of loops and cycles, we must further restrict the class of input spaces to combinatorial. 2 ...

Combinatorial Structures and Algorithms: Phase Transition ...

The phase transition in random combinatorial structure has captured the attention of many scientists, and the intense study has brought together different ...

Faster Generation of Shorthand Universal Cycles for Permutations

This paper provides two new algorithmic con- structions that create successive ... Graham, Universal cycles for combinatorial struc- tures, Discrete ...

De Bruijn Sequence and Universal Cycle Constructions

Concatenation constructions [FM78,DHS+18,GS17,GS18,SSTW23] have led to the most efficient algorithms to construct DB sequences, with some obtaining O(1) O ( 1 ) ...

A Survey of Combinatorial Gray Codes | PDF | Permutation - Scribd

constructions which provide new insights into the structure of combinatorial families. ... GRAHAM, Universal cycles for combinatorial structures, Discrete Math., ...

Combinatorial realisation of cycles and small covers - EMS Press

We also obtain some new results on the relationship of URC-manifolds with theory of simplicial volume. 2010 Mathematics Subject Classification. Primary 57N65, ...

Combinatorics, symmetric functions and Hilbert schemes

Abstract. We survey the proof of a series of conjectures in combinatorics using new results on the geometry of Hilbert schemes. The combinatorial results ...

Antonio Blanca

Random Structures & Algorithms, 2020, 56 (2), pp. 373-400. RANDOM 2018 ... On universal cycles for new classes of combinatorial structures. A. Blanca ...

#2727 - Universal cycles for permutation classes

We define a universal cycle for a class of $n$-permutations as a cyclic word in which each element of the class occurs exactly once as an $n$-factor.

Combinatorial Theory - eScholarship

We also study their permutation analogs, namely, increasing subsequences in uniform random separable permutations. First, we prove that, with high probability ...

Chapter 2: Combinatorial Classes - An Invitation to Enumeration

For example, if w ( s ) = length of s w(s) = \text{length of s s s} w(s)=length of s then C \mathcal{C} C and w w w define a combinatorial class. On the other ...

Combinatorial Generation

... new algorithms for constructing lists of combinatorial objects of various types. ... to “Universal Cycles”. These are a very inter- esting ...

Universal cycles for permutation classes - Archive ouverte HAL

We define a universal cycle for a class of $n$-permutations as a cyclic word in which each element of the class occurs exactly once as an $n$-factor.

The Two Cultures of Mathematics | The n-Category Café

In a sense this is merely a “reinterpretation” of the kind of enumerative combinatorics where one defines some kind of combinatorial structure ...

Universal cycle classes - Numdam

may regard as universal cycle classes for local complete intersections. ... do is the composition of the structural map F(8) -+ T, together with.