{"id":"e-ffe061be849ea709","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-299efe8218728fe3","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":"8078ef06454c110ffd4f751393a570daf0d24904a248b936ad4682d802cde918","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":5389,"certificate_compressed_size":1478,"conclusion_name":"Triangle read by rows: T(n,k) is the number of induced subgraphs of the Lucas cube Lambda(n) that are isomorphic to the hypercube Q(k).","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-299efe8218728fe3","claim":"real_rooted"},{"node_id":"n-299efe8218728fe3","claim":"one_signed_coefficients"},{"node_id":"n-299efe8218728fe3","claim":"hadamard_kernel"},{"node_id":"n-299efe8218728fe3","claim":"interlacing"}]}