Pages that link to "Item:Q1097279"
From MaRDI portal
The following pages link to Computationally efficient bounds for the Catalan numbers (Q1097279):
Displaying 12 items.
- Parallel family trees for transfer matrices in the Potts model (Q337713) (← links)
- A strong non-overlapping Dyck code (Q832919) (← links)
- Computationally efficient bounds for the Catalan numbers (Q1097279) (← links)
- Maximal intersecting families (Q1898053) (← links)
- Uniform spanning forests on biased Euclidean lattices (Q2077334) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- Arithmetic and \(k\)-maximality of the cyclic free magma (Q2317377) (← links)
- On the approximation of Catalan numbers and other quantities (Q2639063) (← links)
- A compilation of relations between graph invariants—supplement I (Q3977270) (← links)
- (Q5505175) (← links)
- Optimal error bounds for non-expansive fixed-point iterations in normed spaces (Q6038647) (← links)
- The saturation spectrum for antichains of subsets (Q6139859) (← links)
