{"id":"e-ea32b6656d780f1e","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-e3a9cbbad5cb7ab4","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":"d26c275e3cf60fb22fe931f47c4d03fc0561dac27057379c215f1ff25fa027ee","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":5295,"certificate_compressed_size":1508,"conclusion_name":"Triangle read by rows: T(n,k) is the number of words over alphabet {0,1,2,3} having exactly k occurrences of the string 01, where n>=0 and k>=0.","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-e3a9cbbad5cb7ab4","claim":"real_rooted"},{"node_id":"n-e3a9cbbad5cb7ab4","claim":"one_signed_coefficients"},{"node_id":"n-e3a9cbbad5cb7ab4","claim":"hadamard_kernel"},{"node_id":"n-e3a9cbbad5cb7ab4","claim":"interlacing"}]}