{"id":"e-812d7652116e2c87","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-b27d3cb0708b3bee","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":"875db9865f0f14f17fd68f78f6082d53741b500dd5e378cc86bc4e275e116587","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":14898,"certificate_compressed_size":2936,"conclusion_name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2)). A Fibonacci binary word is a binary word having no 00 subword. A run of 1's is a maximal subword of the form 11..1.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-8c1a47047f1958de","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k runs of 1's (n >= 0, 0 <= k <= floor((n+1)/2)). A Fibonacci binary word is a binary word having no 00 subword. A run of 1's is a maximal subword of the form 11..1.","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-b27d3cb0708b3bee","claim":"real_rooted"},{"node_id":"n-b27d3cb0708b3bee","claim":"one_signed_coefficients"},{"node_id":"n-b27d3cb0708b3bee","claim":"hadamard_kernel"},{"node_id":"n-b27d3cb0708b3bee","claim":"interlacing"}]}
