{"id":"e-7c3667820056c57c","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-e3d901814302c059","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":"50c63492d7603c7830e32bbeabbb1f739baaf646c714daefe7225db2e2524b16","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":2276,"certificate_compressed_size":967,"conclusion_name":"Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2)).","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-e3d901814302c059","claim":"real_rooted"},{"node_id":"n-e3d901814302c059","claim":"one_signed_coefficients"},{"node_id":"n-e3d901814302c059","claim":"hadamard_kernel"},{"node_id":"n-e3d901814302c059","claim":"interlacing"}]}