Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013611
- Concludes
- basis_map_A013611 of Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/…
- Premises
- Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2…
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 Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2…
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-812d7652116e2c87· 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-256875db9865f0f14f17fd68f78f6082d53741b500dd5e378cc86bc4e275e116587, 14,898 bytes (2,936 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-b27d3cb0708b3bee(real_rooted)n-b27d3cb0708b3bee(one_signed_coefficients)n-b27d3cb0708b3bee(hadamard_kernel)n-b27d3cb0708b3bee(interlacing)