{"id":"e-44889429ca934e63","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-288a7b414c3511ae","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":"0591cf1b7ea7aab9e134d562a7e9d7e0ddaa29bb63315013e3c2e457fba6f55c","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":10340,"certificate_compressed_size":2309,"conclusion_name":"shift_x_plus_one of basis_map_A013609 of 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"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-22e887254e1ffff8","role":"sequence","name":"basis_map_A013609 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..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-288a7b414c3511ae","claim":"one_signed_coefficients"},{"node_id":"n-288a7b414c3511ae","claim":"hadamard_kernel"},{"node_id":"n-288a7b414c3511ae","claim":"interlacing"},{"node_id":"n-288a7b414c3511ae","claim":"real_rooted"}]}