Proof step
Laguerre’s theorem on multiplier sequences
Image under a real-rootedness preserver euler polynomial, shift 0
- Concludes
- theta_plus_one_squared of Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.
- Premises
- Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.
- 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-4055a12c596ba57a· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-25682c6284784002555a9596983a59f8eb2f382db3727845af3bb2e5b8b2d0f9f80, 12,248 bytes (3,250 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-9be10ad9a53be547(real_rooted)n-9be10ad9a53be547(one_signed_coefficients)n-9be10ad9a53be547(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.