When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length $n$ patterns in the separable permutations is equal to the number of partitions of $n-1$.
@article{10_37236_4797,
author = {Michael Albert and Cheyne Homberger and Jay Pantone},
title = {Equipopularity classes in the separable permutations},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {2},
doi = {10.37236/4797},
zbl = {1310.05006},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4797/}
}
TY - JOUR
AU - Michael Albert
AU - Cheyne Homberger
AU - Jay Pantone
TI - Equipopularity classes in the separable permutations
JO - The electronic journal of combinatorics
PY - 2015
VL - 22
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/4797/
DO - 10.37236/4797
ID - 10_37236_4797
ER -
%0 Journal Article
%A Michael Albert
%A Cheyne Homberger
%A Jay Pantone
%T Equipopularity classes in the separable permutations
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/4797/
%R 10.37236/4797
%F 10_37236_4797
Michael Albert; Cheyne Homberger; Jay Pantone. Equipopularity classes in the separable permutations. The electronic journal of combinatorics, Tome 22 (2015) no. 2. doi: 10.37236/4797
