The asymptotic number of $BCK(p)$-terms

A $BCK(p)$-term is a closed lambda-term in which each abstraction binds at most $p$ variables; for $p=1$ these terms are related to the axiom system BCK of combinatory logic. We determine the number of $BCK(p)$-terms of size $n$, up to a constant multiplicative factor, for every $p\ge2$. For $p=2$ the result is fully explicit: \[ f\_n\sim A\,n^{2n/5}2^{n/5}e^{-2n/5}n^{-3/5}e^{P(n^{1/5})}, \] where $P$ is an explicit polynomial of degree $4$. In general the asymptotic formula involves $n^{pn/(2p+1)}$ and an exponential of a polynomial in $n^{1/(2p+1)}$. The proof combines a linearization of the defining functional equation, the analysis of the Borel transform of the linearized generating function, which satisfies a linear differential equation with an irregular singularity at infinity, the saddle point method for Hayman-admissible functions, and positivity arguments comparing the original and the linearized sequences. For $p=1$ this comparison fails: the quadratic term then also changes the polynomial factor.

Authors

Institutions

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16554
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The asymptotic number of $BCK(p)$-terms

Olivier Bodini
arXiv (Cornell University)
Advanced Combinatorial Mathematics
preprint

The asymptotic number of $BCK(p)$-terms

Olivier Bodini
preprint en

Abstract

A $BCK(p)$-term is a closed lambda-term in which each abstraction binds at most $p$ variables; for $p=1$ these terms are related to the axiom system BCK of combinatory logic. We determine the number of $BCK(p)$-terms of size $n$, up to a constant multiplicative factor, for every $p\ge2$. For $p=2$ the result is fully explicit: \[ f\_n\sim A\,n^{2n/5}2^{n/5}e^{-2n/5}n^{-3/5}e^{P(n^{1/5})}, \] where $P$ is an explicit polynomial of degree $4$. In general the asymptotic formula involves $n^{pn/(2p+1)}$ and an exponential of a polynomial in $n^{1/(2p+1)}$. The proof combines a linearization of the defining functional equation, the analysis of the Borel transform of the linearized generating function, which satisfies a linear differential equation with an irregular singularity at infinity, the saddle point method for Hayman-admissible functions, and positivity arguments comparing the original and the linearized sequences. For $p=1$ this comparison fails: the quadratic term then also changes the polynomial factor.

arXiv (Cornell University)
Laboratoire Analyse, Géométrie et Applications (FR)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon