{"id":"e-8937236f6b2a3215","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-72cbbb2f152c8f9c","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":"a79bb999a0eefa6a6f5f967353d05f8073546b1d29e279b60baac355d3aaa4db","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":14445,"certificate_compressed_size":2834,"conclusion_name":"Triangle T(n,k), read by rows, given by (2, -1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1/2, -1/2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.","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-a5d9cd4cf05da467","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword.","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-72cbbb2f152c8f9c","claim":"one_signed_coefficients"},{"node_id":"n-72cbbb2f152c8f9c","claim":"hadamard_kernel"},{"node_id":"n-72cbbb2f152c8f9c","claim":"real_rooted"},{"node_id":"n-72cbbb2f152c8f9c","claim":"interlacing"}]}