Proof step `e-33e8cdf9e54d9cd4`

preserver_image euler_polynomial, shift 0 → concludes about theta_plus_one of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Sc… 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\":[\"1\"],\"denominator\":[\"1\"]}]}"
}

Premises

Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral … (sequence)
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]

Claims

{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }
{ "claim": "interlacing", "from_index": 2, "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 54cddb2e45601153430b449624d0f8b3f26651240a42377e90045816bf37056d, 17,498 bytes (3,895 compressed); download JSON

Cited by

n-8ed5cfff0540233a (interlacing)
n-8ed5cfff0540233a (real_rooted)
n-8ed5cfff0540233a (one_signed_coefficients)
n-8ed5cfff0540233a (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.

Proof step e-33e8cdf9e54d9cd4