Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A007318
- Concludes
- shift_x_plus_one of Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).
- Premises
- Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-2782dc1aefe773f5· 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-2564b5c64da5a3c211f7be7fc5ea7ae2ca9d082a7fa8951749bb4f90228a57bea4f, 14,581 bytes (2,811 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f61e14215f72611a(one_signed_coefficients)n-f61e14215f72611a(hadamard_kernel)n-f61e14215f72611a(real_rooted)n-f61e14215f72611a(interlacing)