Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013610
- Concludes
- reversal of basis_map_A013609 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 length) of i…
- Premises
- basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A le…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A le…
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-81444537730c310a· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013610", "operation": "basis_map" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
basis_map, SHA-256fb007256b7ff8ed45b695d8ed6f23251991825082a4b27d76602bd3b47496a91, 6,855 bytes (1,393 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-b72d7f4ac8913a8c(real_rooted)n-b72d7f4ac8913a8c(one_signed_coefficients)n-b72d7f4ac8913a8c(hadamard_kernel)