# Combinatorial generation via permutation languages. I. Fundamentals

@article{Hartung2020CombinatorialGV, title={Combinatorial generation via permutation languages. I. Fundamentals}, author={Elizabeth J. Hartung and Hung Phuc Hoang and Torsten M{\"u}tze and Aaron Williams}, journal={ArXiv}, year={2020}, volume={abs/1906.06069} }

In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many known results and allows us to prove many new ones. In particular, we obtain four classical Gray codes for permutations, bitstrings, binary trees and set partitions as special cases. We present two distinct applications for our new framework: The first main…

## Figures and Tables from this paper

## 6 Citations

Combinatorial generation via permutation languages

- Computer ScienceSODA
- 2020

A general and versatile algorithmic framework for exhaustively generating a large variety of diﬀerent combinatorial objects, based on encoding them as permutations, which provides a uniﬁed view on many known results and allows us to prove many new ones.

Efficient Generation of Rectangulations via Permutation Languages

- Computer ScienceSoCG
- 2021

This work presents a versatile algorithmic framework for exhaustively generating a large variety of different classes of generic rectangulation classes, and begins a systematic investigation of pattern avoidance in rectangulations.

Combinatorial Gray codes-an updated survey

- Computer Science
- 2022

This survey provides a comprehensive picture of the state-of-the-art of the research on combinatorial Gray codes and gives an update on Savage’s influential survey, incorporating many more recent developments.

Efficient generation of elimination trees and graph associahedra

- Mathematics, Computer ScienceProceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
- 2022

It is proven that all elimination trees for a chordal graph G can be generated by tree rotations using a simple greedy algorithm, and it is proved that the algorithm produces a Hamilton cycle on the graph associahedron of G, rather than just Hamilton path, if the graph G is chordal and 2-connected.

Strong convexity in flip-graphs

- Mathematics
- 2021

The triangulations of a surface Σ with a prescribed set of vertices can be endowed with a graph structure F(Σ). Its edges connect two triangulations that differ by a single arc. It is known that,…

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges

- Computer ScienceFUN
- 2022

For any matroid, the authors can greedily compute a listing of all its bases matroid such that consecutive bases differ by a base exchange, and can generate each successive spanning tree without storing the previous trees by maintaining a small amount of information.

## References

SHOWING 1-10 OF 98 REFERENCES

Combinatorial generation via permutation languages

- Computer ScienceSODA
- 2020

A general and versatile algorithmic framework for exhaustively generating a large variety of diﬀerent combinatorial objects, based on encoding them as permutations, which provides a uniﬁed view on many known results and allows us to prove many new ones.

Exhaustive generation for permutations avoiding a (colored) regular sets of patterns

- Mathematics, Computer ScienceDiscret. Appl. Math.
- 2019

More restrictive Gray codes for some classes of pattern avoiding permutations

- Mathematics, Computer ScienceInf. Process. Lett.
- 2009

Combinatorial Gray codes for classes of pattern avoiding permutations

- Computer ScienceTheor. Comput. Sci.
- 2008

Pattern Avoidance in Permutations: Linear and Cyclic Orders

- MathematicsElectron. J. Comb.
- 2002

We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the first one…

Combinatorial generation via permutation languages. II. Lattice congruences

- Mathematics, Computer ScienceIsrael Journal of Mathematics
- 2021

It is proved that all of the cover graphs of the corresponding lattice quotients have a Hamilton path, which can be computed by a simple greedy algorithm and characterized which of these graphs are vertex-transitive or regular via their arc diagrams.

A Survey of Combinatorial Gray Codes

- Computer ScienceSIAM Rev.
- 1997

The area of combinatorial Gray codes is surveyed, recent results, variations, and trends are described, and some open problems are highlighted.

Generating Trees for Permutations Avoiding Generalized Patterns

- Mathematics, Computer Science
- 2007

Generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of lengths 3 and 4 are built by adding at each level an entry to the right end of the permutation, which allows to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern.

A general exhaustive generation algorithm for Gray structures

- Computer ScienceActa Informatica
- 2007

Gray structures are defined as the sets of those combinatorial objects whose construction can be encoded by a succession rule with the stability property, a characteristic that can be found among various succession rules, such as the finite, factorial or transcendental ones.

The X-Class and Almost-Increasing Permutations

- Mathematics
- 2007

In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in Knuth [4] in connection to sorting algorithms. A…