Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013610
- Concludes
- basis_map_A013610 of Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).
- Premises
- Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6463d3d90d256a8f· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-2561e102d52a8eb8305f4772e1fd126a2e840a2b227c98d07e904bfcf3f0b442e51, 14,694 bytes (2,936 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-5e9bc8ceab9ca150(real_rooted)n-5e9bc8ceab9ca150(one_signed_coefficients)n-5e9bc8ceab9ca150(hadamard_kernel)n-5e9bc8ceab9ca150(interlacing)