The combinatorics of even trees

MaRDI QIDQ2716635zbMATH OpenFDO

Authors Naiomi T. Cameron

Publication date 2 January 2002

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

binomial identitiesCatalan-like sequenceChung-Feller theoremeven treesgenerated functionpathsternary trees

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83)

Recommendations

• scientific article; zbMATH DE number 2221988
• scientific article; zbMATH DE number 2232270
• Combinatorics of non-ambiguous trees
• Combinatorics of non-ambiguous trees
• On the combinatorics of leftist trees
• Some combinatorial problems on ordered trees
• The arithmetic of trees
• Some combinatorial properties of splitting trees
• Enumeration problems of trees

Cited in

(9)

• Odd or even on plane trees
• The butterfly decomposition of plane trees
• Refined Chung-Feller theorems for lattice paths
• Returns, hills, and \(t\)-ary trees
• Combinatorics of non-ambiguous trees
• The combinatorics of \(M'=3M^3T\) and \(T'=T^3M\)
• On the combinatorics of leftist trees
• k-non-crossing trees and edge statistics modulo k
• Generating functions for a lattice path model introduced by Deutsch

This page was built for publication: The combinatorics of even trees

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