{"id":"e-8239b1c6b4764045","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":"75ac45a5ece707a69127081905aac1ec98084fc5c21cdd763f1373cfe6557418","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":1170,"certificate_compressed_size":617,"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"}]}