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: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.

Premises

Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.
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-3abcbe06e4b32101 · 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"
    }
  }
}

Certificate

preserver_image, SHA-256 c5eb40a8e09082c7dbba72091c130d98e1f755a07138caca1ee3d6c29cea208f, 10,297 bytes (2,848 compressed); download

polytool replayed the certificate when the step was written.

Cited by

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