Finite difference calculus for alternating permutations

DOI10.1080/10236198.2013.794794MaRDI QIDQ2869921zbMATH OpenOpenAlexFDO

Authors Dominique Foata, Guo-Niu Han

Publication date 7 January 2014

Published in Journal of Difference Equations and Applications (Search for Journal in Brave)

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

zbMATH Keywords

difference equationalternating permutationssecant numberstangent numbersPoupard trianglestrictly ordered binary trees

Mathematics Subject Classification ID

General theory of difference equations (39A05)

Abstract: The finite difference equation system introduced by Christiane Poupard in the study of tangent trees is reinterpreted in the alternating permutation environment. It makes it possible to make a joint study of both tangent and secant trees and calculate the generating polynomial for alternating permutations by a new statistic, referred to as being the greater neighbor of the maximum.

Recommendations

• Tree calculus for bivariate difference equations
• The Entringer-Poupard matrix sequence
• A survey of alternating permutations
• Counting permutations by alternating descents
• Increasing trees and alternating permutations

Cites work

• A q-enumeration of alternating permutations
• Bijections for Entringer families
• Combinatorics of geometrically distributed random variables: New \(q\)-tangent and \(q\)-secant numbers
• Congruences for the q-secant numbers
• DOUBLOONS AND NEW Q-TANGENT NUMBERS
• De nouvelles significations enumeratives des nombres d'Entringer
• Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
• The On-Line Encyclopedia of Integer Sequences
• The q-tangent and q-secant numbers via basic Eulerian polynomials
• The q-tangent and q-secant numbers via continued fractions
• The doubloon polynomial triangle
• Two other interpretations of the Entringer numbers

Cited in

(9)

• Tree calculus for bivariate difference equations
• Combinatorial identities arising from permanents for Euler numbers and Stirling numbers
• The Entringer-Poupard matrix sequence
• Secant tree calculus
• Seidel triangle sequences and Bi-Entringer numbers
• The \(r\)-alternating permutations
• Permanent identities, combinatorial sequences, and permutation statistics
• Basic calculus of signed permutations. II: Finite analogues of Bessel functions
• On the roots of the Poupard and Kreweras polynomials

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Finite difference calculus for alternating permutations

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