Bijections in weakly increasing trees via binary trees
From MaRDI portal
Cites work
- A bijection on ordered trees and its consequences
- A context-free grammar for peaks and double descents of permutations
- A general bijective algorithm for trees.
- A symmetry on weakly increasing trees and multiset Schett polynomials
- Catalan Numbers
- Congruences involving generalized central trinomial coefficients
- Consecutive patterns in permutations
- Context-free grammars for permutations and increasing trees
- Context-free grammars, differential operators and formal power series
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 3433888 (Why is no real title available?)
- Identities involving weighted Catalan, Schröder and Motzkin paths
- Increasing trees and alternating permutations
- More bijective combinatorics of weakly increasing trees
- New refinements of Narayana polynomials and Motzkin polynomials
- Non-overlapping descents and ascents in stack-sortable permutations
- Old and young leaves on plane trees
- On the \(\gamma\)-positivity of multiset Eulerian polynomials
- Parity statistics on restricted permutations and the Catalan-Schett polynomials
- Partially ordered generalized patterns
- Patterns in permutations and words.
- Restricted plane tree representations of four Motzkin-Catalan equations
- Two bijections on weakly increasing trees
- Two involutions on binary trees and generalizations
- Weakly increasing trees on a multiset
This page was built for publication: Bijections in weakly increasing trees via binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933601)
