Protected points in ordered trees
From MaRDI portal
Publication:2425405
DOI10.1016/j.aml.2007.07.001zbMath1138.05308OpenAlexW2039053128MaRDI QIDQ2425405
Louis W. Shapiro, Gi-Sang Cheon
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
Catalan numberMotzkin numbersordered treecentral binomial coefficient\(\{0, 1, 2\}\)-treesfine numberprotected point
Related Items (23)
Protected Branches in Ordered Trees ⋮ Protection number in plane trees ⋮ On the peel number and the leaf-height of Galton–Watson trees ⋮ Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Protected cells in compositions ⋮ Unnamed Item ⋮ Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes ⋮ The hitting time subgroup, Łukasiewicz paths and Faber polynomials ⋮ \(k\)-protected vertices in binary search trees ⋮ Protected points in \(k\)-ary trees ⋮ Protection numbers in simply generated trees and Pólya trees ⋮ Summations on the diagonals of a Riordan array and some applications ⋮ DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION ⋮ The uplift principle for ordered trees ⋮ Notes on protected nodes in digital search trees ⋮ PICK TWO POINTS IN A TREE ⋮ \(k\)-protected vertices in unlabeled rooted plane trees ⋮ Asymptotic distribution of two-protected nodes in random binary search trees ⋮ Protected Vertices in Motzkin trees ⋮ On 2-protected nodes in random digital trees ⋮ Weakly protected points in ordered trees ⋮ Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees ⋮ Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers
Cites Work
This page was built for publication: Protected points in ordered trees
