Binary Trees, Left and Right Paths, WKB Expansions, and Painlevé Transcendents

DOI10.1137/1.9781611972962.2MaRDI QIDQ5233146zbMATH OpenOpenAlexFDO

Authors Wojciech Szpankowski, Charles Knessl

Publication date 16 September 2019

Published in 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972962.2

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Painlevé and other special ordinary differential equations in the complex domain; classification, hierarchies (34M55) Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• Binary trees, coproducts and integrable systems
• Binary search trees, recurrent properties and wave equations
• Left-right pairs and complex forests of infinite rooted binary trees
• scientific article; zbMATH DE number 894188
• scientific article; zbMATH DE number 647421
• The Cantor-Bendixson analysis of finite trees
• The extended Cantor-Bendixson analysis of trees
• Planar rooted trees and non-associative exponential series
• Matrix-tree theorems and discrete path integration
• The Magnus expansion, trees and Knuth's rotation correspondence

Cited in

(4)

• Kinematic numerators from the worldsheet: cubic trees from labelled trees
• On the Joint Path Length Distribution in Random Binary Trees
• Left and right pathlengths in random binary trees
• The left-right-imbalance of binary search trees

This page was built for publication: Binary Trees, Left and Right Paths, WKB Expansions, and Painlevé Transcendents

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