On the number of unary-binary tree-like structures with restrictions on the unary height

DOI10.1007/s00026-018-0371-7zbMath1384.05034arXiv1510.01167OpenAlexW2964055800MaRDI QIDQ1745901

Olivier Bodini, Bernhard Gittenberger, Zbigniew Gołȩbiewski, Daniéle Gardy

Publication date: 18 April 2018

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.01167

zbMATH Keywords

generating functionsasymptotic enumerationtreessingularity analysisdirected acyclic graphslambda-termsnested square-roots

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Functional programming and lambda calculus (68N18) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (4)

Distribution of variables in lambda-terms with restrictions on De Bruijn indices and De Bruijn levels ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Asymptotic enumeration of compacted binary trees of bounded right height ⋮ Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics and random sampling for BCI and BCK lambda terms
• Enumeration of generalized BCI lambda-terms
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• Planar maps and continued fractions
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Lectures on the Curry-Howard isomorphism
• Counting proofs in propositional logic
• Combinatorial aspects of continued fractions
• BCK and BCI logics, condensed detachment and the 2-property
• A calculus for the random generation of labelled combinatorial structures
• On counting untyped lambda terms
• The number of trees
• A Natural Counting of Lambda Terms
• Boltzmann sampling of ordered structures
• The fraction of large random trees representing a given Boolean function in implicational logic
• Boys-and-girls Birthdays and Hadamard Products
• Boltzmann Samplers, Pólya Theory, and Cycle Pointing
• Isomorphism and Symmetries in Random Phylogenetic Trees
• Singularity Analysis of Generating Functions
• Intuitionistic vs. Classical Tautologies, Quantitative Comparison
• Random Trees
• On the Altitude of Nodes in Random Trees
• On the number of lambda terms with prescribed size of their De Bruijn representation
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• A Theory of Positive Integers in Formal Logic. Part II
• A Theory of Positive Integers in Formal Logic. Part I
• Asymptotically almost all \lambda-terms are strongly normalizing
• Boltzmann Sampling of Unlabelled Structures
• Lambda terms of bounded unary height
• On the asymptotic number of BCK(2)-terms
• Analytic Samplers and the Combinatorial Rejection Method
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• Counting and generating lambda terms
• On axiom systems of propositional calculi, I
• The Number of Planted Plane Trees with a Given Partition
• An Unsolvable Problem of Elementary Number Theory

This page was built for publication: On the number of unary-binary tree-like structures with restrictions on the unary height