{"id":"e-8187ad69de0e901a","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-97b51734d39ede6c","premise_count":0,"theorem":"polytool parent provers, route paper_theorem: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"e716c9c843543ff8be3be21e3c8c467bf66562c966db7bc2bebd81a196bf4f78","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":2062,"certificate_compressed_size":867,"conclusion_name":"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":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-97b51734d39ede6c","claim":"real_rooted"},{"node_id":"n-97b51734d39ede6c","claim":"one_signed_coefficients"},{"node_id":"n-97b51734d39ede6c","claim":"hadamard_kernel"},{"node_id":"n-97b51734d39ede6c","claim":"interlacing"}]}