{"id":"e-1e6b41b2748404cf","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-1336d058dca9979e","premise_count":0,"theorem":"polytool parent provers, route root_domain: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"7c9de2194e6cbeeb08e2d7bf1bcf9b0ff62a1a72989c49596df826fcf261d8e1","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":1435,"certificate_compressed_size":730,"conclusion_name":"Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[],"cited_by":[{"node_id":"n-1336d058dca9979e","claim":"real_rooted"},{"node_id":"n-1336d058dca9979e","claim":"one_signed_coefficients"},{"node_id":"n-1336d058dca9979e","claim":"hadamard_kernel"}]}