Increasing trees and alternating permutations

DOI10.1070/RM1994V049N06ABEH002448MaRDI QIDQ4872714zbMATH OpenFDO

Authors Igor Pak, A. E. Postnikov, Alexander Kuznetsov

Publication date 17 July 1996

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/RM1994V049N06ABEH002448

zbMATH Keywords

alternating permutationsAndré polynomialsbinary treesbranchingsCatalan and Bell numberscombinatorial identitiesembedded treesEntringer numbersEuler and Bernoulli numbersEuler-Bernoulli triangleFoata groupgeometric classes of treesincreasing treesinversion polynomialstatisticsTutte dichromate

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Bernoulli and Euler numbers and polynomials (11B68) Bell and Stirling numbers (11B73)

Recommendations

• Generating trees and pattern avoidance in alternating permutations
• Enumerating alternating trees
• scientific article; zbMATH DE number 892276
• A general bijective algorithm for increasing trees
• Permutations in binary trees and split trees
• The representation of permutations by trees
• Permutrees
• Permutrees
• scientific article; zbMATH DE number 6928770
• On enumerating tree permutations in natural order

Cited in

(39)

• On the number of connected components in the space of M-polynomials in hyperbolic functions
• Rooted forests that avoid sets of permutations
• The Euler and Springer numbers as moment sequences
• Weakly increasing trees on a multiset
• Classical and consecutive pattern avoidance in rooted forests
• Length-four pattern avoidance in inversion sequences
• More connections between the matching polynomial and the chromatic polynomial
• Efficient computation of Favard constants and their connection to Euler polynomials and numbers
• More bijections for Entringer and Arnold families
• Combinatorial bases for multilinear parts of free algebras with two compatible brackets
• The \(r\)-alternating permutations
• Passing through a stack \(k\) times with reversals
• An involution on increasing trees
• Forest-like permutations
• Enumerating split-pair arrangements
• Random doubly stochastic tridiagonal matrices
• Finite difference calculus for alternating permutations
• Combinatorial interpretations for T_G(1, - 1)
• The Entringer-Poupard matrix sequence
• Context-free grammars for permutations and increasing trees
• On the evaluation of the Tutte polynomial at the points (1, -1) and (2, -1)
• Secant tree calculus
• Perfect trees and bit-reversal permutations
• scientific article; zbMATH DE number 6928770 (Why is no real title available?)
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• An adjacent-swap Markov chain on coalescent trees
• Enumerating alternating trees
• Minimax trees and André polynomials
• Bijections for Entringer families
• A grammatical calculus for peaks and runs of permutations
• A combinatorial link between labelled graphs and increasingly labelled Schröder trees
• Two involutions on binary trees and generalizations
• More bijective combinatorics of weakly increasing trees
• Classical continued fractions for some multivariate polynomials generalizing the Genocchi and median Genocchi numbers
• Bijections in weakly increasing trees via binary trees
• A symmetry on weakly increasing trees and multiset Schett polynomials
• Enumeration results for alternating tree families
• On the degree distribution of the nodes in increasing trees
• Expansions of a chord diagram and alternating permutations

This page was built for publication: Increasing trees and alternating permutations

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