Proof step
Laguerre’s theorem on multiplier sequences
Image under a real-rootedness preserver euler polynomial, shift 0
- Concludes
- theta_plus_one of Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- Premises
- Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - 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-72737e709303e989· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256c5cfbf355cae8102d8d95870a92078669c0f0620af6c6e0b3092e67264f44eaf, 13,954 bytes (3,319 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-d5120fbfd4c4c97a(real_rooted)n-d5120fbfd4c4c97a(one_signed_coefficients)n-d5120fbfd4c4c97a(hadamard_kernel)n-d5120fbfd4c4c97a(interlacing)
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.