Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A007318
- Concludes
- basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
- Premises
- Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-7a81428d9a710134· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A007318", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-256b239c1ccef8c5b0199d666e4c54a9294ab5515daff93b093b818d96a7364d3d6, 13,787 bytes (2,581 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-07af2e6e3c9f0c77(real_rooted)n-07af2e6e3c9f0c77(one_signed_coefficients)n-07af2e6e3c9f0c77(hadamard_kernel)n-07af2e6e3c9f0c77(interlacing)