{"id":"e-2d36970d4b706ae4","operation":{"index_shift":2,"operation":"preserver_image","operator":"{\"shape\":\"hadamard_multiplier\",\"factor\":{\"terms\":[{\"kind\":\"binomial\",\"index_offset\":1,\"coefficient_offset\":1}]}}"},"operation_detail":"hadamard_multiplier, shift 2","conclusion_id":"n-7a4827a398e28fe4","premise_count":1,"theorem":"Polya--Schur characterization of multiplier sequences (G. Polya and I. Schur, J. Reine Angew. Math. 144 (1914) 89--113; stated as Theorem 40 of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601): a real sequence (lambda_k) is a multiplier sequence (x^k -> lambda_k x^k maps real-rooted polynomials to real-rooted polynomials or zero) iff sum_k binom(m,k) lambda_k x^k is real-rooted with zeros of one sign for every m, iff sum_k lambda_k x^k / k! (or its reflection) is C x^m e^(a x) prod (1 + alpha_j x) with a, alpha_j >= 0; a product of multiplier sequences is one (composition), and a nonzero factor lambda(n) of the row changes nothing","lean_route":null,"lean_declarations":[],"certificate_hash":"600f73e2742f78a272bb29be54a72ec87962e044106bcdecbcb2392a90df8c9a","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"preserver_image","certificate_raw_size":26894,"certificate_compressed_size":9174,"conclusion_name":"Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-c8c19eba9d68881f","role":"sequence","name":"binomial","uses":{"claim":"real_rooted","from_index":2,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 2, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-7a4827a398e28fe4","claim":"real_rooted"},{"node_id":"n-7a4827a398e28fe4","claim":"one_signed_coefficients"},{"node_id":"n-7a4827a398e28fe4","claim":"hadamard_kernel"}]}