Asymptotics of the extremal excedance set statistic

DOI10.1016/J.EJC.2014.11.008MaRDI QIDQ2255803zbMATH OpenOpenAlexFDO

Authors Rodrigo Ferraz de Andrade, Erik Lundberg, B. Nagle

Publication date 18 February 2015

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

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

zbMATH Keywords

permutationgenerating functionschromatic polynomialrook placementsexcedance setLDU-decomposiotion of associated matrices

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73)

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.

Recommendations

• Asymptotic enumeration of permutations avoiding generalized patterns
• The excedance set of a permutation
• Explicit expressions for the extremal excedance set statistics
• Multiple pattern avoidance with respect to fixed points and excedances
• Asymptotic estimates for the number of permutations without short cycles

Cites work

• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3236230 (Why is no real title available?)
• scientific article; zbMATH DE number 3263280 (Why is no real title available?)
• scientific article; zbMATH DE number 3322983 (Why is no real title available?)
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Almost all orbit types imply period-3
• Analytic combinatorics in several variables.
• Asymptotic enumeration of permutations avoiding generalized patterns
• Asymptotics of multivariate sequences. I: Smooth points of the singular variety
• COEXISTENCE OF CYCLES OF A CONTINUOUS MAP OF THE LINE INTO ITSELF
• Consecutive patterns in permutations
• Explicit expressions for the extremal excedance set statistics
• Generalized pattern frequency in large permutations
• Generalized permutation patterns and a classification of the Mahonian statistics
• New Euler-Mahonian statistics on permutations and words
• The excedance set of a permutation
• Théorie géométrique des polynômes eulériens
• Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions

Cited in

(8)

• Exact and asymptotic distributions of exceedance statistics for bivariate random sequences
• Toppleable permutations, excedances and acyclic orientations
• Explicit expressions for the extremal excedance set statistics
• Asymptotic enumeration of lonesum matrices
• On asymptotic distributions of exceedance statistics
• On the oscillation of the expected number of extreme points of a random set
• Toppling on permutations with an extra chip
• Combinatorial properties of poly-Bernoulli relatives

Describes a project that uses

Uses Software

• OEIS

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)