{"id":"n-f3e531515387ff48","revision":0,"first_index":0,"fingerprint":"f6-404da8017663bad2","name":"theta_plus_one of veronese_section_2_1 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.","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":[[],["1"],["4"],["9","2"],["16","16"],["25","60","3"],["36","160","36"],["49","350","189","4"],["64","672","672","64"],["81","1176","1890","432","5"],["100","1920","4536","1920","100"],["121","2970","9702","6600","825","6"],["144","4400","19008","19008","4400","144"],["169","6292","34749","48048","17875","1404","7"],["196","8736","60060","109824","60060","8736","196"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","1","4","11","32","88","232","592","1472","3584","8576","20224","47104","108544","247808"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["1"],["4"],["9","2"],["16","16"],["25","60","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","3","-3","1"]]},"deriv_order":0,"offset":6,"sign":"none"},{"coeff":{"coeffs":[["6","-12","6"]]},"deriv_order":0,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["-15","18","-3"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["20","-12"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-15","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172782,"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-3a6ab0ab4e93b928"]},{"id":172783,"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-3a6ab0ab4e93b928"]},{"id":172784,"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-3a6ab0ab4e93b928"]}],"region_exact":{},"incoming_edges":[{"id":"e-3a6ab0ab4e93b928","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-f3e531515387ff48","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":"573fa67f732fec1ca680e1ddadbbf417064b6cae46087c21f93484990a76601a","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-97f11494a55819c4","role":"sequence","name":"veronese_section_2_1 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.","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:  1;\n  2:  4;\n  3:  9,    2;\n  4: 16,   16;\n  5: 25,   60,    3;\n  6: 36,  160,   36;\n  7: 49,  350,  189,   4;\n  8: 64,  672,  672,  64;\n  9: 81, 1176, 1890, 432, 5;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(1-3*x+3*x^2-x^3)*P(n-6,x) + (6-12*x+6*x^2)*P(n-5,x) - (15-18*x+3*x^2)*P(n-4,x) + (20-12*x)*P(n-3,x) - (15-3*x)*P(n-2,x) + 6*P(n-1,x) for n >= 6, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 4, P(3,x) = 9 + 2*x, P(4,x) = 16 + 16*x, P(5,x) = 25 + 60*x + 3*x^2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[2, x_] := 4;\nP[3, x_] := 9 + 2*x;\nP[4, x_] := 16 + 16*x;\nP[5, x_] := 25 + 60*x + 3*x^2;\nP[n_, x_] := P[n, x] = Expand[-(1 - 3*x + 3*x^2 - x^3)*P[n - 6, x] + (6 - 12*x + 6*x^2)*P[n - 5, x] - (15 - 18*x + 3*x^2)*P[n - 4, x] + (20 - 12*x)*P[n - 3, x] - (15 - 3*x)*P[n - 2, x] + 6*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] = 1; v[3] = 4; v[4] = 9 + 2*x; v[5] = 16 + 16*x; v[6] = 25 + 60*x + 3*x^2; for(n = 6, N, my(i = n + 1); v[i] = -(1 - 3*x + 3*x^2 - x^3)*v[i - 6] + (6 - 12*x + 6*x^2)*v[i - 5] - (15 - 18*x + 3*x^2)*v[i - 4] + (20 - 12*x)*v[i - 3] - (15 - 3*x)*v[i - 2] + 6*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-f24dc5f77f658331","steps":["Veronese 2 (j=1)","\u03b8+1"],"edges":["e-132af071e8732ba7","e-3a6ab0ab4e93b928"],"text":"A093375 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1"},"headline":"A093375 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1","chain":null}