Progressive and rushed Dyck paths

DOI10.4204/EPTCS.403.10MaRDI QIDQ6934121zbMATH OpenFDO

Authors Axel Bacher

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.403.10

zbMATH Keywords

onesided treesprogressive pathsrushed paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05)

Cites work

• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Analysis of series expansions for non-algebraic singularities
• Basic analytic combinatorics of directed lattice paths
• Compacted binary trees admit a stretched exponential
• Culminating paths
• Discrete excursions
• Enumeration of d-combining Tree-Child Networks
• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 3390782 (Why is no real title available?)
• Lattice animals and heaps of dimers
• Local limits of one-sided trees
• Trees with exponential height dependent weight

Cited in

(1)

• Patterns in rectangulations. I: -like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths

This page was built for publication: Progressive and rushed Dyck paths

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