Proof step

Iterated real-rootedness preservers

Theorem check of the sequence's own rule iterated preserver

Concludes: Triangle read by rows, s_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.
Premises: none: a direct theorem check
Theorem: [SP14; Bra15, Thm 7.1 of arXiv:1410.6601; Bra06, Cor 3.5] polytool ?
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-e562a98feae0f20b · JSON

Operation

Theorem check of the sequence's own rule

{
  "operation": "theorem_check",
  "theorem": "iterated_preserver"
}

Claims

{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}

{
  "claim": "interlacing",
  "from_index": 1,
  "kind": "weak",
  "orientation": "previous_interlaces_next"
}

Certificate

theorem_check, SHA-256 b980abbb15ff9b9ddcc1e48de5fe5cad372462adf44d0f56d344ee12e2e1d9c5, 3,720 bytes (1,280 compressed); download

polytool replayed the certificate when the step was written.

Cited by

References

[Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
[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.