{"id":"e-a158dc81d41b25b5","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-b1a7dcc8610d7e32","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":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"433949b96adc2ef6c1b3607250037c85ac7320a1ff0e4c10cb4358aa98ef7dc3","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":4723,"certificate_compressed_size":1486,"conclusion_name":"Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 0 <= 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-b1a7dcc8610d7e32","claim":"interlacing"},{"node_id":"n-b1a7dcc8610d7e32","claim":"real_rooted"},{"node_id":"n-b1a7dcc8610d7e32","claim":"one_signed_coefficients"},{"node_id":"n-b1a7dcc8610d7e32","claim":"hadamard_kernel"}]}