About half the middle binomial coefficient

MaRDI QIDQ2755046zbMATH OpenFDO

Authors R. Pinzani, S. Rinaldi, Andrea Frosini

Publication date 5 November 2001

Published in PU.M.A. Pure Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

Catalan numbers

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Review text

A bijection is described between the set of nodes of degree 1 in ordered trees with \(n+1\) edges and the set of \(2n+2\)-length Dyck paths. The generating function for \(f_{n,k}\) is determined in terms of the generating function for the Catalan numbers (\(f_{n,k}\) is the number of points of height \(k\) in Dyck paths of length \(2n\)). It is also shown that the number of nodes at level \(k\) in ordered trees of \(n\) edges is \({{2k+1}\over{n+k+1}}{{2n}\choose{n-k}}\).

Recommendations

• scientific article; zbMATH DE number 894188
• A bijection on ordered trees and its consequences
• Enumerations of vertices among all rooted ordered trees with levels and degrees
• A bijection between symmetric valleys in Dyck paths and even degree interval vertices in ordered trees
• scientific article; zbMATH DE number 468836

Cited in

(4)

• A bijection on ordered trees and its consequences
• On directed-convex polyominoes in a rectangle
• Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)
• A bijection between symmetric valleys in Dyck paths and even degree interval vertices in ordered trees

This page was built for publication: About half the middle binomial coefficient

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