Increasing trees and alternating permutations

DOI10.1070/RM1994v049n06ABEH002448zbMath0842.05025MaRDI QIDQ4872714

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

Publication date: 17 July 1996

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

zbMATH Keywords

combinatorial identitiesbranchingsstatisticsbinary treesincreasing treesalternating permutationsEntringer numbersinversion polynomialembedded treesEuler and Bernoulli numbersAndré polynomialsCatalan and Bell numbersEuler-Bernoulli triangleFoata groupgeometric classes of treesTutte dichromate

Mathematics Subject Classification ID

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

Related Items (27)

Combinatorial interpretations for TG(1, −1) ⋮ An adjacent-swap Markov chain on coalescent trees ⋮ 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)\) ⋮ More connections between the matching polynomial and the chromatic polynomial ⋮ On the degree distribution of the nodes in increasing trees ⋮ Bijections for Entringer families ⋮ Secant tree calculus ⋮ On the number of connected components in the space of M-polynomials in hyperbolic functions ⋮ 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 ⋮ Expansions of a chord diagram and alternating permutations ⋮ Rooted forests that avoid sets of permutations ⋮ Efficient computation of Favard constants and their connection to Euler polynomials and numbers ⋮ Combinatorial families of multilabelled increasing trees and hook-length formulas ⋮ The Euler and Springer numbers as moment sequences ⋮ Enumerating split-pair arrangements ⋮ Combinatorial bases for multilinear parts of free algebras with two compatible brackets ⋮ Weakly increasing trees on a multiset ⋮ The \(r\)-alternating permutations ⋮ Passing through a stack \(k\) times with reversals ⋮ Random doubly stochastic tridiagonal matrices ⋮ An involution on increasing trees ⋮ Classical and consecutive pattern avoidance in rooted forests ⋮ Length-four pattern avoidance in inversion sequences

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