Proof step e-499b0a6a3661d54f

preserver_image euler_polynomial, shift 0 → concludes about theta_plus_one_squared of Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2). 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 read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2). (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }
• { "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 9cc141a3b59f5ea681a3e69720a410b854521f053f689cccea481c118280c0a9, 15,209 bytes (3,607 compressed); download JSON

Cited by

• n-3872500ae150330f (real_rooted)
• n-3872500ae150330f (one_signed_coefficients)
• n-3872500ae150330f (hadamard_kernel)
• n-3872500ae150330f (interlacing)

References

1. [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
2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.