Geodesic
Bounded affine permutations I. Pattern avoidance and enumeration
Discrete mathematics & theoretical computer science, Permutation Patterns 2019, Tome 22 (2020-2021) no. 2.

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

We introduce a new boundedness condition for affine permutations, motivated by the fruitful concept of periodic boundary conditions in statistical physics. We study pattern avoidance in bounded affine permutations. In particular, we show that if $\tau$ is one of the finite increasing oscillations, then every $\tau$-avoiding affine permutation satisfies the boundedness condition. We also explore the enumeration of pattern-avoiding affine permutations that can be decomposed into blocks, using analytic methods to relate their exact and asymptotic enumeration to that of the underlying ordinary permutations. Finally, we perform exact and asymptotic enumeration of the set of all bounded affine permutations of size $n$. A companion paper will focus on avoidance of monotone decreasing patterns in bounded affine permutations. 
@article{DMTCS_2021_22_2_a1,
     author = {Madras, Neal and Troyka, Justin M.},
     title = {Bounded affine permutations {I.} {Pattern} avoidance and enumeration},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {2020-2021},
     doi = {10.46298/dmtcs.6178},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6178/}
}
TY  - JOUR
AU  - Madras, Neal
AU  - Troyka, Justin M.
TI  - Bounded affine permutations I. Pattern avoidance and enumeration
JO  - Discrete mathematics & theoretical computer science
PY  - 2020-2021
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6178/
DO  - 10.46298/dmtcs.6178
LA  - en
ID  - DMTCS_2021_22_2_a1
ER  - 
%0 Journal Article
%A Madras, Neal
%A Troyka, Justin M.
%T Bounded affine permutations I. Pattern avoidance and enumeration
%J Discrete mathematics & theoretical computer science
%D 2020-2021
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6178/
%R 10.46298/dmtcs.6178
%G en
%F DMTCS_2021_22_2_a1
Madras, Neal; Troyka, Justin M. Bounded affine permutations I. Pattern avoidance and enumeration. Discrete mathematics & theoretical computer science, Permutation Patterns 2019, Tome 22 (2020-2021) no. 2. doi : 10.46298/dmtcs.6178. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6178/

Cité par Sources :