Proof step
Laguerre’s theorem on multiplier sequences
Image under a real-rootedness preserver euler polynomial, shift 0
- Concludes
- theta_plus_one of shift_x_plus_one of Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
- Premises
- shift_x_plus_one of Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle read by rows: coefficients d(n,k) of André polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
- Theorem
- [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ?
- Lean
- RealRooted
RealRooted.isMultiplierSequence_eval_of_roots_nonpos,RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos,RealRooted.isMultiplierSequence_iff_preserves - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-4bfb0b5e34f58f7d· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-25653f15e67d757dfe8603f44d1e4b9f923044ba2b9782a79cc4fd5fd6186712e47, 30,182 bytes (5,486 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-d5117d09cd06dd68(real_rooted)n-d5117d09cd06dd68(one_signed_coefficients)n-d5117d09cd06dd68(hadamard_kernel)
References
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.