Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
- Premises
- Exponential Riordan array (1, x(1+x/2)).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Exponential Riordan array (1, x(1+x/2)).
- Theorem
- polytool ?
- Lean
- RealRooted
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-8138551054fb2168· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-2564e83f3619d55ac9db8874ec6caf05f9544d069bcca608bb04b5a42037bbecdf5, 9,511 bytes (2,591 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-97b51734d39ede6c(real_rooted)n-97b51734d39ede6c(one_signed_coefficients)n-97b51734d39ede6c(hadamard_kernel)