{"id":"e-6ec8133a57dfcfe3","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-e8e64448d4c6498a","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction","lean_route":null,"lean_declarations":["RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos"],"certificate_hash":"d5728f6f4543c3abebcaa422f7a774d820a7958c8bfdf9f3e61079a350b7c5c0","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":5421,"certificate_compressed_size":1601,"conclusion_name":"Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[],"cited_by":[{"node_id":"n-e8e64448d4c6498a","claim":"real_rooted"},{"node_id":"n-e8e64448d4c6498a","claim":"one_signed_coefficients"},{"node_id":"n-e8e64448d4c6498a","claim":"hadamard_kernel"}]}