Proof step e-9a50147d814dfb7b
obreschkoff_combination → concludes about obreschkoff_combination of Triangle read by rows, T(n, k) = 4^k*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0. JSON
Theorem
Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?
Operation
Obreschkoff combination Pₙ + Pₙ₊₁
{
"operation": "obreschkoff_combination"
}
Premises
- Triangle read by rows, T(n, k) = 4^k*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0. (sequence)
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)
- Triangle read by rows, T(n, k) = 4^k*S_4(n, k) where S_m(n, k) are the Stirling-Frobenius subset numbers of order m; n >= 0, k >= 0. (sequence)
uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
Claims
- { "claim": "real_rooted", "from_index": 1, "region": {} }
Verification and certificate
- polytool: replayed (the certificate replayed when the step was written)
- Lean: not attempted
- certificate:
obreschkoff_combination, SHA-2561c8f145c763ff763353f9ae30d8e7c15a0cae9f7df24218e52947797db16d5ae, 11,392 bytes (2,586 compressed); download JSON
Cited by
n-54cd774d491372da(real_rooted)
References
- [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
- [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.