Proof step `e-60eb617d7ec68f2c`

preserver_image euler_polynomial, shift 0 → concludes about theta_plus_one_squared of Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n. 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

Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n. (sequence)
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]

Claims

{ "claim": "real_rooted", "from_index": 1, "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 1fce4397a1a7abc61f9c3e2ed60036992674b30c19b363379dfe30f500cab03b, 10,264 bytes (2,853 compressed); download JSON

Cited by

n-be708c90ebfa68eb (real_rooted)
n-be708c90ebfa68eb (one_signed_coefficients)
n-be708c90ebfa68eb (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-60eb617d7ec68f2c