Geodesic
Number of cycles in the graph of $312$-avoiding permutations
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) (2014).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2014_special_265_a3,
     author = {Ehrenborg, Richard and Kitaev, Sergey and Steingr{\i}msson, Einar},
     title = {Number of cycles in the graph of $312$-avoiding permutations},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)},
     year = {2014},
     doi = {10.46298/dmtcs.2378},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2378/}
}
TY  - JOUR
AU  - Ehrenborg, Richard
AU  - Kitaev, Sergey
AU  - Steingrımsson, Einar
TI  - Number of cycles in the graph of $312$-avoiding permutations
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2378/
DO  - 10.46298/dmtcs.2378
LA  - en
ID  - DMTCS_2014_special_265_a3
ER  - 
%0 Journal Article
%A Ehrenborg, Richard
%A Kitaev, Sergey
%A Steingrımsson, Einar
%T Number of cycles in the graph of $312$-avoiding permutations
%J Discrete mathematics & theoretical computer science
%D 2014
%V DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2378/
%R 10.46298/dmtcs.2378
%G en
%F DMTCS_2014_special_265_a3
Ehrenborg, Richard; Kitaev, Sergey; Steingrımsson, Einar. Number of cycles in the graph of $312$-avoiding permutations. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014) (2014). doi : 10.46298/dmtcs.2378. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2378/

Cité par Sources :