Computationally efficient bounds for the Catalan numbers
From MaRDI portal
Publication:1097279
DOI10.1016/S0195-6698(86)80024-5zbMath0635.05005MaRDI QIDQ1097279
Robert C. Brigham, Ronald D. Dutton
Publication date: 1986
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Factorials, binomial coefficients, combinatorial functions (05A10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (11)
A strong non-overlapping Dyck code ⋮ A compilation of relations between graph invariants—supplement I ⋮ Computationally efficient bounds for the Catalan numbers ⋮ Maximal intersecting families ⋮ On the approximation of Catalan numbers and other quantities ⋮ Parallel family trees for transfer matrices in the Potts model ⋮ Optimal error bounds for non-expansive fixed-point iterations in normed spaces ⋮ The saturation spectrum for antichains of subsets ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Arithmetic and \(k\)-maximality of the cyclic free magma ⋮ Uniform spanning forests on biased Euclidean lattices
Cites Work
This page was built for publication: Computationally efficient bounds for the Catalan numbers
