Asymptotics of the extremal excedance set statistic

From MaRDI portal
Publication:2255803

DOI10.1016/J.EJC.2014.11.008zbMATH Open1307.05003arXiv1403.0691OpenAlexW1982263614MaRDI QIDQ2255803FDOQ2255803


Authors: Rodrigo Ferraz de Andrade, Erik Lundberg, B. Nagle Edit this on Wikidata


Publication date: 18 February 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate asymptotic methods of R. Pemantle and M. C. Wilson. We also consider two applications of our main result. First, we determine asymptotics on the number of permutations of size n which simultaneously avoid the generalized patterns 21-34 and 34-21. Second, we determine asymptotics on the number of n-cycles that admit no stretching pairs.


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




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Asymptotics of the extremal excedance set statistic

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