Proof step `e-a8b2755a293a1f99`

preserver_image euler_polynomial, shift 0 → concludes about theta_plus_one_squared of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1. JSON

Theorem

Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?

Lean (RealRooted): RealRooted.isMultiplierSequence_eval_of_roots_nonpos, RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos, RealRooted.isMultiplierSequence_iff_preserves

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\"]}]}"
}

Premises

Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1. (sequence)
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }

Verification and certificate

polytool: replayed (the certificate replayed when the step was written)
Lean: not attempted
certificate: preserver_image, SHA-256 4cbb55f5b400d17b4c1ffc7eae46f6ec738d698e26a63bf4bedc9b44b29880f8, 15,770 bytes (4,042 compressed); download JSON

Cited by

n-f9acf9db26f6bbe8 (real_rooted)
n-f9acf9db26f6bbe8 (one_signed_coefficients)
n-f9acf9db26f6bbe8 (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.

Proof step e-a8b2755a293a1f99