Alternating, pattern-avoiding permutations

From MaRDI portal
Publication:1010899

zbMATH Open1158.05302arXiv0805.1964MaRDI QIDQ1010899FDOQ1010899

Joel Brewster Lewis

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set S_n(132) of 132-avoiding permutations and the set A_{2n + 1}(132) of alternating, 132-avoiding permutations. For every set p_1, ..., p_k of patterns and certain related patterns q_1, ..., q_k, our bijection restricts to a bijection between S_n(132, p_1, ..., p_k), the set of permutations avoiding 132 and the p_i, and A_{2n + 1}(132, q_1, ..., q_k), the set of alternating permutations avoiding 132 and the q_i. This reduces the enumeration of the latter set to that of the former.


Full work available at URL: https://arxiv.org/abs/0805.1964

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)






Cited In (11)


   Recommendations





This page was built for publication: Alternating, pattern-avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010899)