Protected points in ordered trees

DOI10.1016/J.AML.2007.07.001MaRDI QIDQ2425405zbMATH OpenOpenAlexFDO

Authors Gi-Sang Cheon, Louis W. Shapiro

Publication date 5 May 2008

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aml.2007.07.001

zbMATH Keywords

\(\{0, 1, 2\}\)-treesCatalan numbercentral binomial coefficientfine numberMotzkin numbersordered treeprotected point

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Weakly protected points in ordered trees
• Protected points in \(k\)-ary trees
• Protected nodes and fringe subtrees in some random trees
• \(k\)-protected vertices in unlabeled rooted plane trees
• Enumeration of protected nodes in Motzkin trees

Cites work

• A bijection between ordered trees and 2-Motzkin paths and its many consequences
• A survey of the Fine numbers
• Asymptotic Methods in Enumeration
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)

Cited in

(25)

• \(k\)-protected vertices in unlabeled rooted plane trees
• Weakly protected points in ordered trees
• Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
• Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes
• Nonleaf patterns in trees: protected nodes and fine numbers
• k-protected vertices in binary search trees
• The uplift principle for ordered trees
• Notes on protected nodes in digital search trees
• Protection number in plane trees
• Protected vertices in Motzkin trees
• Protection number of recursive trees
• Protected cells in bargraphs
• Pick two points in a tree
• Degree profile of m-ary search trees: a vehicle for data structure compression
• Protected Branches in Ordered Trees
• On the peel number and the leaf-height of Galton–Watson trees
• On 2-protected nodes in random digital trees
• The hitting time subgroup, Łukasiewicz paths and Faber polynomials
• Protection numbers in simply generated trees and Pólya trees
• Summations on the diagonals of a Riordan array and some applications
• Protected points in \(k\)-ary trees
• The distribution of the maximum protection number in simply generated trees
• Pattern avoidance in parking functions
• Asymptotic distribution of two-protected nodes in random binary search trees
• Protected cells in compositions

This page was built for publication: Protected points in ordered trees

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