{"id":"e-d718d4a3c4d020a8","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-e5924eef99dd90a5","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"f4206575d33b2883598110be068bfb349210a09cc3cc19af3a4bfd2ef5eee5e0","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":10545,"certificate_compressed_size":2315,"conclusion_name":"basis_map_A013610 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-97b51734d39ede6c","role":"sequence","name":"Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-e5924eef99dd90a5","claim":"real_rooted"},{"node_id":"n-e5924eef99dd90a5","claim":"one_signed_coefficients"},{"node_id":"n-e5924eef99dd90a5","claim":"hadamard_kernel"},{"node_id":"n-e5924eef99dd90a5","claim":"interlacing"}]}