{"id":"e-f5018d5f4ba5a310","operation":{"operation":"theorem_check","theorem":"liu_wang"},"operation_detail":"liu_wang","conclusion_id":"n-765f9e2b013b3c68","premise_count":0,"theorem":"L. L. Liu and Y. Wang, A unified approach to polynomial sequences with only real zeros, Adv. in Appl. Math. 38 (2007) 542-560, Theorem 2.1 with g = f' (as in their Corollary 2.4), with nonnegativity of the coefficients replaced by an exact induction keeping every root in (-inf, 0)","lean_route":null,"lean_declarations":[],"certificate_hash":"270f8fab2202ccc8786205c6d7400e6db6173ae3308584cb1432fa3f9a6acaf5","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":2717,"certificate_compressed_size":1034,"conclusion_name":"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":false,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-765f9e2b013b3c68","claim":"real_rooted"},{"node_id":"n-765f9e2b013b3c68","claim":"one_signed_coefficients"},{"node_id":"n-765f9e2b013b3c68","claim":"hadamard_kernel"},{"node_id":"n-765f9e2b013b3c68","claim":"interlacing"}]}