Proof step

Laguerre’s theorem on multiplier sequences

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

Concludes

theta_plus_one of veronese_section_2_1 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.

Premises

veronese_section_2_1 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
sequence: Every row P_n, n >= 0, 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-3a6ab0ab4e93b928 · 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": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}

Certificate

preserver_image, SHA-256 573fa67f732fec1ca680e1ddadbbf417064b6cae46087c21f93484990a76601a, 10,330 bytes (2,525 compressed); download

polytool replayed the certificate when the step was written.

Cited by

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