Proof step e-ffb008f602bb5117

basis_map A013609 → concludes about basis_map_A013609 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). JSON

Theorem

Geometric basis map (elementary) polytool ?

Operation

Image under a basis map u^k -> P_k

{
  "map": "A013609",
  "operation": "basis_map"
}

Premises

• Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }
• { "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: basis_map, SHA-256 58bf59ec39dfdb327cec0b84441fa0700615a3f85167c04594356f7dbf2ccf11, 10,545 bytes (2,315 compressed); download JSON

Cited by

• n-6a6677e3386580cd (real_rooted)
• n-6a6677e3386580cd (one_signed_coefficients)
• n-6a6677e3386580cd (hadamard_kernel)
• n-6a6677e3386580cd (interlacing)