{"id":"n-69faac4de95638e6","revision":0,"first_index":0,"fingerprint":"f6-6c66841fb057b992","name":"theta_plus_one of veronese_section_2_0 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],[],["0","2"],["0","6"],["0","22","3"],["0","100","30"],["0","548","255","4"],["0","3528","2205","84"],["0","26136","20307","1288","5"],["0","219168","201852","18144","180"],["0","2053152","2171040","253092","4350","6"],["0","21257280","25228500","3608220","90750","330"],["0","241087680","315774228","53358140","1787115","11550","7"],["0","2972885760","4242044664","824280600","34633170","334620","546"],["0","39605518080","60941259288","13344475144","675182365","8846838","26117","8"]],"degrees":[0,-1,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","0","2","6","25","130","807","5817","47736","439344","4481640","50185080","612018720","8074179360","114575307840"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0"],["0","2"],["0","6"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-256","32","-1"],["256","-16","0"],["-96","2","0"],["16","0","0"],["-1","0","0"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-175","14"],["148","-4"],["-42","0"],["4","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-55","2"],["36","0"],["-6","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-10"],["4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":175319,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-1d2808b563db60be"]},{"id":175320,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-1d2808b563db60be"]},{"id":175321,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-1d2808b563db60be"]}],"region_exact":{},"incoming_edges":[{"id":"e-1d2808b563db60be","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-69faac4de95638e6","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"63eb2353a0a37ed39e893337099a4858ef30f9f1e7ffc282737def5deffdf0f1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-24a064d270958fff","role":"sequence","name":"veronese_section_2_0 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 0;\n  2: 0,      2;\n  3: 0,      6;\n  4: 0,     22,      3;\n  5: 0,    100,     30;\n  6: 0,    548,    255,     4;\n  7: 0,   3528,   2205,    84;\n  8: 0,  26136,  20307,  1288,   5;\n  9: 0, 219168, 201852, 18144, 180;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^4-16*n^3+96*n^2-256*n+256-(2*n^2-16*n+32)*x+x^2)*P(n-4,x) + (4*n^3-42*n^2+148*n-175-(4*n-14)*x)*P(n-3,x) - (6*n^2-36*n+55-2*x)*P(n-2,x) + (4*n-10)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 0, P(2,x) = 2*x, P(3,x) = 6*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 0;\nP[2, x_] := 2*x;\nP[3, x_] := 6*x;\nP[n_, x_] := P[n, x] = Expand[-(n^4 - 16*n^3 + 96*n^2 - 256*n + 256 - (2*n^2 - 16*n + 32)*x + x^2)*P[n - 4, x] + (4*n^3 - 42*n^2 + 148*n - 175 - (4*n - 14)*x)*P[n - 3, x] - (6*n^2 - 36*n + 55 - 2*x)*P[n - 2, x] + (4*n - 10)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 0; v[3] = 2*x; v[4] = 6*x; for(n = 4, N, my(i = n + 1); v[i] = -(n^4 - 16*n^3 + 96*n^2 - 256*n + 256 - (2*n^2 - 16*n + 32)*x + x^2)*v[i - 4] + (4*n^3 - 42*n^2 + 148*n - 175 - (4*n - 14)*x)*v[i - 3] - (6*n^2 - 36*n + 55 - 2*x)*v[i - 2] + (4*n - 10)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["Veronese 2","\u03b8+1"],"edges":["e-37358459ee0a1b93","e-1d2808b563db60be"],"text":"A132393 \u2192 Veronese 2 \u2192 \u03b8+1"},"headline":"A132393 \u2192 Veronese 2 \u2192 \u03b8+1","chain":null}