{"id":"n-e02dc9e2d951d040","revision":0,"first_index":0,"fingerprint":"f6-ec74e0786b506eff","name":"theta_plus_one of veronese_section_2_1 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["2"],["2"],["4","16"],["12","96"],["48","560","96"],["240","3600","1440"],["1440","25984","16800","512"],["10080","210112","188160","14336"],["80640","1889984","2155104","279552","2560"],["725760","18763200","25855200","4838400","115200"],["7257600","204057216","328025280","80779776","3379200","12288"],["79833600","2414687616","4415590080","1350429696","83635200","811008"],["958003200","30904952832","63091856256","23034998272","1918625280","33386496","57344"],["12454041600","425547472896","955939560576","404962894336","42674311680","1119326208","5218304"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","2","2","20","108","704","5280","44736","422688","4407840","50297760","623511360","8344987200","119941879680","1842702825600"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["2"],["2"],["4","16"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-256","128","-16"],["256","-64","0"],["-96","8","0"],["16","0","0"],["-1","0","0"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-175","56"],["148","-16"],["-42","0"],["4","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-55","8"],["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":178210,"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-151f76aece1bc67d"]},{"id":178211,"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-151f76aece1bc67d"]},{"id":178212,"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-151f76aece1bc67d"]}],"region_exact":{},"incoming_edges":[{"id":"e-151f76aece1bc67d","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-e02dc9e2d951d040","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":"0d277ff97f3ef3a7e4c4f6c317727cfa6c8da826ec1a56c05f0d6aad0e23cf74","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-cd0e6a1564dd27fb","role":"sequence","name":"veronese_section_2_1 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 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:     0;\n  1:     2;\n  2:     2;\n  3:     4,      16;\n  4:    12,      96;\n  5:    48,     560,      96;\n  6:   240,    3600,    1440;\n  7:  1440,   25984,   16800,    512;\n  8: 10080,  210112,  188160,  14336;\n  9: 80640, 1889984, 2155104, 279552, 2560;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^4-16*n^3+96*n^2-256*n+256-(8*n^2-64*n+128)*x+16*x^2)*P(n-4,x) + (4*n^3-42*n^2+148*n-175-(16*n-56)*x)*P(n-3,x) - (6*n^2-36*n+55-8*x)*P(n-2,x) + (4*n-10)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 2, P(2,x) = 2, P(3,x) = 4 + 16*x.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 2;\nP[2, x_] := 2;\nP[3, x_] := 4 + 16*x;\nP[n_, x_] := P[n, x] = Expand[-(n^4 - 16*n^3 + 96*n^2 - 256*n + 256 - (8*n^2 - 64*n + 128)*x + 16*x^2)*P[n - 4, x] + (4*n^3 - 42*n^2 + 148*n - 175 - (16*n - 56)*x)*P[n - 3, x] - (6*n^2 - 36*n + 55 - 8*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] = 0; v[2] = 2; v[3] = 2; v[4] = 4 + 16*x; for(n = 4, N, my(i = n + 1); v[i] = -(n^4 - 16*n^3 + 96*n^2 - 256*n + 256 - (8*n^2 - 64*n + 128)*x + 16*x^2)*v[i - 4] + (4*n^3 - 42*n^2 + 148*n - 175 - (16*n - 56)*x)*v[i - 3] - (6*n^2 - 36*n + 55 - 8*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-60c7e36cbe887b7e","steps":["Veronese 2 (j=1)","\u03b8+1"],"edges":["e-28dcf565f3f6cf28","e-151f76aece1bc67d"],"text":"A137320 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1"},"headline":"A137320 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1","chain":null}