A Combinatorial Bijection between Ordered Trees and Lattice Paths

DOI10.5540/tcam.2023.024.03.00427MaRDI QIDQ6177043

No author found.

Publication date: 16 January 2024

Published in: Trends in Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial identitylattice pathsordered treescentral trinomial coefficients

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Congruences involving generalized central trinomial coefficients
• Enumerations of ordered trees
• On the edge set of graphs of lattice paths
• A bijective proof of the equation linking the Schröder numbers, large and small

This page was built for publication: A Combinatorial Bijection between Ordered Trees and Lattice Paths