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 read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0…

Premises

Triangle read by rows, Ward numbers T(n, k) = Sum_{m=0..k} (-1)^(m + k) * binomial(n + k, n + m) * Stirling2(n + m, m), for n >= 0, 0 <= k …
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]

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-3122244141ab1bdb · 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-256 231df6628f807e08654ddefcdc8bd89d2a550e5e439044c5354ac7456beb638b, 12,047 bytes (3,300 compressed); download

polytool replayed the certificate when the step was written.

Cited by

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