{"id":"n-3a80d454b8f8dfa1","revision":1,"first_index":0,"fingerprint":"f6-2be0a5b069dfbb51","name":"theta_plus_one_squared of Triangle read by rows: T(n,k) = binomial(k,n-k).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","4"],["0","8","9"],["0","4","27","16"],["0","0","27","64","25"],["0","0","9","96","125","36"],["0","0","0","64","250","216","49"],["0","0","0","16","250","540","343","64"],["0","0","0","0","125","720","1029","512","81"],["0","0","0","0","25","540","1715","1792","729","100"],["0","0","0","0","0","216","1715","3584","2916","1000","121"],["0","0","0","0","0","36","1029","4480","6804","4500","1331","144"],["0","0","0","0","0","0","343","3584","10206","12000","6655","1728","169"],["0","0","0","0","0","0","49","1792","10206","21000","19965","9504","2197","196"],["0","0","0","0","0","0","0","512","6804","25200","39930","31680","13182","2744","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","17","47","116","266","579","1213","2467","4901","9552","18324","34685","64909","120277"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["0","-1","0"],["1","-6","1"],["2","-3","0"],["1","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","-4","-8","2"],["0","-10","-20","2"],["4","10","-11","0"],["2","10","0","0"],["-2","0","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-8","2","1"],["0","0","-24","-2","1"],["0","4","-11","-3","0"],["0","4","1","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160869,"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-f958c519243bd336"]},{"id":160870,"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-f958c519243bd336"]},{"id":160871,"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-f958c519243bd336"]}],"region_exact":{},"incoming_edges":[{"id":"e-f958c519243bd336","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-3a80d454b8f8dfa1","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":"628116da50ec9f11466a033b7aa9cd8b110cbf82dc763ef1db2c4f2bfc44a183","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-21854f4257effb01","role":"sequence","name":"Triangle read by rows: T(n,k) = binomial(k,n-k).","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: 1, 4;\n  2: 0, 8,  9;\n  3: 0, 4, 27, 16;\n  4: 0, 0, 27, 64,  25;\n  5: 0, 0,  9, 96, 125,  36;\n  6: 0, 0,  0, 64, 250, 216,   49;\n  7: 0, 0,  0, 16, 250, 540,  343,   64;\n  8: 0, 0,  0,  0, 125, 720, 1029,  512,  81;\n  9: 0, 0,  0,  0,  25, 540, 1715, 1792, 729, 100;\n","recurrence_sentence":"The row polynomials satisfy (n^4+2*n^3+n^2-(3*n^3+6*n^2+n)*x+n^2*x^2)*P(n,x) = -(2*n^4-2*n^3-4*n^2-(10*n^3+10*n^2-10*n-4)*x+(11*n^2+20*n+8)*x^2-(2*n+2)*x^3)*P(n-1,x) + ((4*n^3+4*n^2)*x+(n^3-11*n^2-24*n-8)*x^2-(3*n^2+2*n-2)*x^3+(n+1)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n^4 - 2*n^3 - 4*n^2 - (10*n^3 + 10*n^2 - 10*n - 4)*x + (11*n^2 + 20*n + 8)*x^2 - (2*n + 2)*x^3)*P[n - 1, x] + ((4*n^3 + 4*n^2)*x + (n^3 - 11*n^2 - 24*n - 8)*x^2 - (3*n^2 + 2*n - 2)*x^3 + (n + 1)*x^4)*D[P[n - 1, x], x])/(n^4 + 2*n^3 + n^2 - (3*n^3 + 6*n^2 + n)*x + n^2*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(2*n^4 - 2*n^3 - 4*n^2 - (10*n^3 + 10*n^2 - 10*n - 4)*x + (11*n^2 + 20*n + 8)*x^2 - (2*n + 2)*x^3)*v[i - 1] + ((4*n^3 + 4*n^2)*x + (n^3 - 11*n^2 - 24*n - 8)*x^2 - (3*n^2 + 2*n - 2)*x^3 + (n + 1)*x^4)*deriv(v[i - 1], x))/(n^4 + 2*n^3 + n^2 - (3*n^3 + 6*n^2 + n)*x + n^2*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-21854f4257effb01","steps":["(\u03b8+1)\u00b2"],"edges":["e-f958c519243bd336"],"text":"A030528 \u2192 (\u03b8+1)\u00b2"},"headline":"A030528 \u2192 (\u03b8+1)\u00b2","chain":null}