Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013611
- Concludes
- basis_map_A013611 of veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal …
- Premises
- veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal l…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal l…
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-a0ee26daf48ac8c0· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013611", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-2569603b0c471ff175a488187157834f709fba1bfa1ae4eaabcb4114ebc9e8e13aa, 15,012 bytes (3,009 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-bd4b98a64f07f1b8(real_rooted)n-bd4b98a64f07f1b8(one_signed_coefficients)n-bd4b98a64f07f1b8(hadamard_kernel)n-bd4b98a64f07f1b8(interlacing)