DOAJ Open Access 2014

Number of cycles in the graph of $312$-avoiding permutations

Richard Ehrenborg Sergey Kitaev Einar Steingrımsson

Lihat Sumber DOI

Abstrak

The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. However, instead of requiring the tail of one permutation to equal the head of another for them to be connected by an edge, we require that the head and tail in question have their letters appear in the same order of size. We give a formula for the number of cycles of length $d$ in the subgraph of overlapping $312$-avoiding permutations. Using this we also give a refinement of the enumeration of $312$-avoiding affine permutations.

Topik & Kata Kunci

Mathematics

Penulis (3)

Richard Ehrenborg

Sergey Kitaev

Einar Steingrımsson

Format Sitasi

APA MLA BibTeX

Ehrenborg, R., Kitaev, S., Steingrımsson, E. (2014). Number of cycles in the graph of $312$-avoiding permutations. https://doi.org/10.46298/dmtcs.2378

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2378

Informasi Jurnal

Tahun Terbit: 2014
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2378
Akses: Open Access ✓