Computationally efficient bounds for the Catalan numbers
From MaRDI portal
In der Arbeit werden leicht berechenbare untere und obere Schranken für die Catalanschen Zahlen \[ C_ n=\frac{1}{n+1}\left( \begin{matrix} 2n\\ n\end{matrix} \right)\quad wo\quad C_ 0=1\quad und\quad C_ n=^{n- 1}_{k=0}C_ kC_{n-1-k},\quad n\geq 1 \] \[ bzw.\quad C_ n=\frac{4n- 2}{n+1-}C_{n-1},\quad n\geq 1 \] angegeben. Das Auswerten nach diesen Formeln ist vom rechnerischen Standpunkt weniger vorteilhaft. Die Autoren führen zwei Formeln mit wesentlich größerer Genauigkeit ein.
Recommendations
Cites work
Cited in
(16)- Computationally efficient bounds for the Catalan numbers
- Maximal intersecting families
- Uniform spanning forests on biased Euclidean lattices
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Arithmetic and \(k\)-maximality of the cyclic free magma
- On the approximation of Catalan numbers and other quantities
- Parallel family trees for transfer matrices in the Potts model
- scientific article; zbMATH DE number 5657639 (Why is no real title available?)
- A compilation of relations between graph invariants—supplement I
- scientific article; zbMATH DE number 58839 (Why is no real title available?)
- scientific article; zbMATH DE number 5497553 (Why is no real title available?)
- Optimal error bounds for non-expansive fixed-point iterations in normed spaces
- The saturation spectrum for antichains of subsets
- Growth and density in free magmas
- Narayana numbers in invariants for interacting particle systems of Itoh-Mallows-Shepp
- A strong non-overlapping Dyck code
This page was built for publication: Computationally efficient bounds for the Catalan numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097279)
