Proof step
Laguerre’s theorem on multiplier sequences
Image under a real-rootedness preserver euler polynomial, shift 0
- Concludes
- theta_plus_one of basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).
- Premises
- basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, n - k - 1).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A007318 of Triangle read by rows. T(n, k) = binomial(n, k)*binomial(n - 1, 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-2908b960c4c0a49d· 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": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256254ebdb4c0d710f0603e1a82bb1244ef3fac18d098341f5ea5322d03bf231910, 20,345 bytes (4,546 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a10502e10fb179e0(real_rooted)n-a10502e10fb179e0(one_signed_coefficients)n-a10502e10fb179e0(hadamard_kernel)n-a10502e10fb179e0(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.