Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013611
- Concludes
- basis_map_A013611 of basis_map_A013611 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
- Premises
- basis_map_A013611 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013611 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-4c2634e58a5e66e4· 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": 1, "kind": "weak", "orientation": "unordered" }- Certificate
basis_map, SHA-2569abbfe1d85825cfafb5a60f90078c5af92bebfae510e1ddb2db987384563c3b9, 15,055 bytes (3,013 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-356f635361b69ad5(real_rooted)n-356f635361b69ad5(one_signed_coefficients)n-356f635361b69ad5(hadamard_kernel)n-356f635361b69ad5(interlacing)