Richard Ehrenborg ; Sergey Kitaev ; Einar Steingrımsson - Number of cycles in the graph of $312$-avoiding permutations

dmtcs:2378 - Discrete Mathematics & Theoretical Computer Science, January 1, 2014, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) - https://doi.org/10.46298/dmtcs.2378
Number of cycles in the graph of $312$-avoiding permutationsArticle

Authors: Richard Ehrenborg ORCID1; Sergey Kitaev ORCID2; Einar Steingrımsson

  • 1 Department of Mathematics
  • 2 Department of Computer and Information Sciences [Univ Strathclyde]

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.


Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Section: Proceedings
Published on: January 1, 2014
Imported on: November 21, 2016
Keywords: permutation pattern,graph of overlapping permutations,number of cycles,affine permutations,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
Funding:
    Source : OpenAIRE Graph
  • Bruhat and balanced graphs, manifolds, partitions and affine permutations; Funder: National Science Foundation; Code: 0902063

1 Document citing this article

Consultation statistics

This page has been seen 249 times.
This article's PDF has been downloaded 238 times.