{"id":"e-44f7d78af53a1cc4","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-9f4aefa5f442e451","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":"e0a6c2e1030fa9b31cbc41be3c3543922be6d02e2069dad29d517e15762e0f47","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":6857,"certificate_compressed_size":1396,"conclusion_name":"basis_map_A013610 of basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-4a6fce4b90b6e934","role":"sequence","name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= 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-9f4aefa5f442e451","claim":"real_rooted"},{"node_id":"n-9f4aefa5f442e451","claim":"one_signed_coefficients"},{"node_id":"n-9f4aefa5f442e451","claim":"hadamard_kernel"}]}