{"id":"n-1ed509e43576fda7","revision":1,"first_index":0,"fingerprint":"f6-75f1cc51c57e12b9","name":"theta_plus_one of Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..., and for k > 0 column k lists two zeros followed by the partial sums of column k-1.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["0","2"],["0","0","3"],["0","0","0","4"],["0","0","0","4","5"],["0","0","0","0","10","6"],["0","0","0","0","0","18","7"],["0","0","0","0","0","6","28","8"],["0","0","0","0","0","0","21","40","9"],["0","0","0","0","0","0","0","48","54","10"],["0","0","0","0","0","0","0","8","90","70","11"],["0","0","0","0","0","0","0","0","36","150","88","12"],["0","0","0","0","0","0","0","0","0","100","231","108","13"],["0","0","0","0","0","0","0","0","0","10","220","336","130","14"],["0","0","0","0","0","0","0","0","0","0","55","420","468","154","15"],["0","0","0","0","0","0","0","0","0","0","0","180","728","630","180","16"]],"degrees":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],"row_sums":["2","3","4","9","16","25","42","70","112","179","286","452","710","1112","1734"],"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"],["0","0","3"],["0","0","0","4"],["0","0","0","4","5"],["0","0","0","0","10","6"]],"recurrence":{"denominator":{"coeffs":[["2"]]},"terms":[{"coeff":{"coeffs":[["0","0","0","12"]]},"deriv_order":0,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","0","4"]]},"deriv_order":1,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","2"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","0","1"]]},"deriv_order":1,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","0","6"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","4"]]},"deriv_order":1,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160765,"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-c5a44f97a1ce25c1"]},{"id":160766,"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-c5a44f97a1ce25c1"]},{"id":160767,"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-c5a44f97a1ce25c1"]}],"region_exact":{},"incoming_edges":[{"id":"e-c5a44f97a1ce25c1","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-1ed509e43576fda7","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":"6941b0ccd9953832734113e9f0caca7131491a063f38d9778be5eabbb9c1e3bd","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-67a75673619cc276","role":"sequence","name":"Square array read by antidiagonals downwards: T(n,k), n>=0, k>=0, in which column 0 is equal to A057427: 0, 1, 1, 1, ..., and for k > 0 column k lists two zeros followed by the partial sums of column k-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, 2;\n  1: 0, 0, 3;\n  2: 0, 0, 0, 4;\n  3: 0, 0, 0, 4,  5;\n  4: 0, 0, 0, 0, 10,  6;\n  5: 0, 0, 0, 0,  0, 18,  7;\n  6: 0, 0, 0, 0,  0,  6, 28,  8;\n  7: 0, 0, 0, 0,  0,  0, 21, 40,  9;\n  8: 0, 0, 0, 0,  0,  0,  0, 48, 54, 10;\n  9: 0, 0, 0, 0,  0,  0,  0,  8, 90, 70, 11;\n","recurrence_sentence":"The row polynomials satisfy 2*P(n,x) = 12*x^3*P(n-5,x) + 4*x^4*d/dx P(n-5,x) + 2*x^3*P(n-4,x) + x^4*d/dx P(n-4,x) + 6*x^2*P(n-3,x) + 4*x^3*d/dx P(n-3,x) + 4*x*P(n-2,x) - (4*x^2-x^3)*d/dx P(n-2,x) + 4*x*P(n-1,x) - x^2*d/dx P(n-1,x) for n >= 5, with P(0,x) = 2*x, P(1,x) = 3*x^2, P(2,x) = 4*x^3, P(3,x) = 4*x^3 + 5*x^4, P(4,x) = 10*x^4 + 6*x^5.","mathematica":"P[0, x_] := 2*x;\nP[1, x_] := 3*x^2;\nP[2, x_] := 4*x^3;\nP[3, x_] := 4*x^3 + 5*x^4;\nP[4, x_] := 10*x^4 + 6*x^5;\nP[n_, x_] := P[n, x] = Expand[Together[(12*x^3*P[n - 5, x] + 4*x^4*D[P[n - 5, x], x] + 2*x^3*P[n - 4, x] + x^4*D[P[n - 4, x], x] + 6*x^2*P[n - 3, x] + 4*x^3*D[P[n - 3, x], x] + 4*x*P[n - 2, x] - (4*x^2 - x^3)*D[P[n - 2, x], x] + 4*x*P[n - 1, x] - x^2*D[P[n - 1, x], x])/(2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 2*x; v[2] = 3*x^2; v[3] = 4*x^3; v[4] = 4*x^3 + 5*x^4; v[5] = 10*x^4 + 6*x^5; for(n = 5, N, my(i = n + 1); v[i] = (12*x^3*v[i - 5] + 4*x^4*deriv(v[i - 5], x) + 2*x^3*v[i - 4] + x^4*deriv(v[i - 4], x) + 6*x^2*v[i - 3] + 4*x^3*deriv(v[i - 3], x) + 4*x*v[i - 2] - (4*x^2 - x^3)*deriv(v[i - 2], x) + 4*x*v[i - 1] - x^2*deriv(v[i - 1], x))/(2)); 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-0d55e0bb3c384646","steps":["reverse","\u03b8+1"],"edges":["e-0e9e334768ea0a35","e-c5a44f97a1ce25c1"],"text":"A102547 \u2192 reverse \u2192 \u03b8+1"},"headline":"A102547 \u2192 reverse \u2192 \u03b8+1","chain":null}