Proof step

Laguerre’s theorem on multiplier sequences

Image under a real-rootedness preserver euler polynomial, shift 0

Concludes

theta_plus_one of Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (5*k - 4)*(m*k - (m - 1))*T(n - 1, k) where m = 0.

Premises

Triangle T(n,k) read by rows: T(n, k) = (m*n - m*k + 1)*T(n - 1, k - 1) + (5*k - 4)*(m*k - (m - 1))*T(n - 1, k) where m = 0.
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-3323b3225e1bfd60 · 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": 1,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}

{
  "claim": "interlacing",
  "from_index": 2,
  "kind": "weak",
  "orientation": "unordered"
}

Certificate

preserver_image, SHA-256 3eca9c5f991afe5093ebc7d4f54f36ff1fe6fbc23fd7c2a6a2d350be0b4f5bc6, 14,026 bytes (3,310 compressed); download

polytool replayed the certificate when the step was written.

Cited by

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