The asymptotics of almost alternating permutations

DOI10.1006/AAMA.2001.0790MaRDI QIDQ696815zbMATH OpenOpenAlexFDO

Authors Richard Ehrenborg

Publication date 12 September 2002

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/aama.2001.0790

zbMATH Keywords

boustrophedon transformEuler numberViennot triangle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16)

Review text

The paper studies asymptotic enumeration of permutations, which are alternating except for a finite number of exceptions. Let \(\beta(l_1,l_2,l_3,\dots ,l_k)\) denote the number of permutations that consist of \(l_1\) ascents, \(l_2\) descents, \(l_3\) ascents, etc. The paper obtains the EGF for the sequence \(\beta(L, 1^{n-m-1})\), where \(L\) is a descent-ascent list of size \(m\). Using the EGF, an asymptotic formula is developed for \(\beta(L, 1^{n-m-1})\), and also for \(\beta(1^a,2,1^b)\) and \(\beta(L_1,1^a,L_2,1^b,L_3)\). All the asymptotics involve Euler numbers, which are in this notation \(\beta(1^{n-1})\).

Recommendations

• Counting permutations by their alternating runs
• Enumeration of permutations by number of alternating descents
• Counting permutations by alternating descents
• A survey of alternating permutations
• Alternating permutations and symmetric functions

Cites work

• A new operation on sequences: The boustrophedon transform
• A probabilistic approach to the descent statistic
• Extremal problems for the Möbius function in the face lattice of the n-octahedron
• Generalized Euler Number Sequences: Asymptotic Estimates and Congruences
• scientific article; zbMATH DE number 3165539 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 486467 (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?)
• Maximizing Möbius functions on subsets of Boolean algebras
• Maximizing the descent statistic
• Permutations ayant une forme donnée
• Permutations with prescribed pattern
• Some Properties of Generalized Euler Numbers

Cited in

(8)

• Asymptotics of permutations with nearly periodic patterns of rises and falls
• A probabilistic approach to the descent statistic
• Zigzag diagrams and Martin boundary
• Counting permutations by their alternating runs
• Adjoining Almost Disjoint Permutations
• An Asymptotic Problem in Derangement Theory
• scientific article; zbMATH DE number 852058 (Why is no real title available?)
• Enumeration of permutations by number of alternating descents

This page was built for publication: The asymptotics of almost alternating permutations

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