{"id":"n-270fa0d4650ef4be","revision":0,"first_index":0,"fingerprint":"f6-14a58a693c7ea773","name":"theta_plus_one of derivative of Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.","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":true,"rows":[[],["1"],["0","4"],["0","4","9"],["0","0","0","16"],["0","0","0","16","25"],["0","0","0","0","0","36"],["0","0","0","0","0","36","49"],["0","0","0","0","0","0","0","64"],["0","0","0","0","0","0","0","64","81"],["0","0","0","0","0","0","0","0","0","100"],["0","0","0","0","0","0","0","0","0","100","121"],["0","0","0","0","0","0","0","0","0","0","0","144"],["0","0","0","0","0","0","0","0","0","0","0","144","169"],["0","0","0","0","0","0","0","0","0","0","0","0","0","196"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","1","4","13","16","41","36","85","64","145","100","221","144","313","196"],"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"],["0","4"]],"recurrence":{"denominator":{"coeffs":[["4"],["-12"],["13"],["-6"],["1"]]},"terms":[{"coeff":{"coeffs":[["12","2"],["-40","-9"],["51","28"],["-31","-30"],["9","13"],["-1","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","1"],["0","-12","-4"],["0","13","10"],["0","-6","-8"],["0","1","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":170970,"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-231269426c479dba"]},{"id":170971,"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-231269426c479dba"]},{"id":170972,"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-231269426c479dba"]}],"region_exact":{},"incoming_edges":[{"id":"e-231269426c479dba","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-270fa0d4650ef4be","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":"b5e7621dc50f789dc5d64483127f0525dd47efd7170cfa578f9d7c4027d9d85f","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-658a3809b8ca6551","role":"sequence","name":"derivative of Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.","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: 0, 4;\n  3: 0, 4, 9;\n  4: 0, 0, 0, 16;\n  5: 0, 0, 0, 16, 25;\n  6: 0, 0, 0,  0,  0, 36;\n  7: 0, 0, 0,  0,  0, 36, 49;\n  8: 0, 0, 0,  0,  0,  0,  0, 64;\n  9: 0, 0, 0,  0,  0,  0,  0, 64, 81;\n","recurrence_sentence":"The row polynomials satisfy (n^4-6*n^3+13*n^2-12*n+4)*P(n,x) = -(n^5-9*n^4+31*n^3-51*n^2+40*n-12+(2*n^5-13*n^4+30*n^3-28*n^2+9*n-2)*x)*P(n-1,x) + ((n^4-6*n^3+13*n^2-12*n+4)*x+(2*n^4-8*n^3+10*n^2-4*n+1)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 4*x.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[2, x_] := 4*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n^5 - 9*n^4 + 31*n^3 - 51*n^2 + 40*n - 12 + (2*n^5 - 13*n^4 + 30*n^3 - 28*n^2 + 9*n - 2)*x)*P[n - 1, x] + ((n^4 - 6*n^3 + 13*n^2 - 12*n + 4)*x + (2*n^4 - 8*n^3 + 10*n^2 - 4*n + 1)*x^2)*D[P[n - 1, x], x])/(n^4 - 6*n^3 + 13*n^2 - 12*n + 4)]];\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*x; for(n = 3, N, my(i = n + 1); v[i] = (-(n^5 - 9*n^4 + 31*n^3 - 51*n^2 + 40*n - 12 + (2*n^5 - 13*n^4 + 30*n^3 - 28*n^2 + 9*n - 2)*x)*v[i - 1] + ((n^4 - 6*n^3 + 13*n^2 - 12*n + 4)*x + (2*n^4 - 8*n^3 + 10*n^2 - 4*n + 1)*x^2)*deriv(v[i - 1], x))/(n^4 - 6*n^3 + 13*n^2 - 12*n + 4)); 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-ea2139b8dbf6bf8d","steps":["D","\u03b8+1"],"edges":["e-0520ed955c545097","e-231269426c479dba"],"text":"A133080 \u2192 D \u2192 \u03b8+1"},"headline":"A133080 \u2192 D \u2192 \u03b8+1","chain":null}
