{"id":"n-24f7309b1202c760","revision":1,"first_index":0,"fingerprint":"f6-172c735f4451d51c","name":"theta_plus_one_squared of Triangle read by rows: coefficients d(n,k) of Andr\u00e9 polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","4"],["1","16"],["1","44","36"],["1","104","306"],["1","228","1620","544"],["1","480","6912","7936"],["1","988","26136","68608","12400"],["1","2008","91746","460288","276400"],["1","4052","306864","2656672","3539600","398016"],["1","8144","993528","13899904","34302200","12582144"],["1","16332","3145500","67963520","280104000","223678368","17125696"],["1","32712","9803970","316590080","2037678000","2955469248","728782096"],["1","65476","30221532","1423223840","13651094000","32404097088","17169640768","951878656"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","5","17","81","411","2393","15329","108133","830443","6905205","61785921","592033417","6048356107","65630221361"],"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"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","8","0"],["0","4","-10"],["0","-4","-13"],["0","0","9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","-2","10","0"],["0","-2","12","-18"],["0","0","4","-32"],["0","0","0","4"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1","2","0"],["0","0","-1","4","-4"],["0","0","0","4","-8"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0"],["1","-4"],["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0"],["0","2","-4"],["0","0","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164155,"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-e49355d6c48303b1"]},{"id":164156,"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-e49355d6c48303b1"]},{"id":164157,"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-e49355d6c48303b1"]}],"region_exact":{},"incoming_edges":[{"id":"e-e49355d6c48303b1","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-24f7309b1202c760","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":"fcf3278574880f91ff1b363d0f019843a004dde167e5bcabffb51dd354b225e1","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-b4814297dd192d81","role":"sequence","name":"Triangle read by rows: coefficients d(n,k) of Andr\u00e9 polynomials D(x,n) = Sum_{k>0} d(n,k)*x^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;\n  2: 1,    4;\n  3: 1,   16;\n  4: 1,   44,    36;\n  5: 1,  104,   306;\n  6: 1,  228,  1620,    544;\n  7: 1,  480,  6912,   7936;\n  8: 1,  988, 26136,  68608,  12400;\n  9: 1, 2008, 91746, 460288, 276400;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = -((4*n^2-4*n-8)*x-(9*n^3-13*n^2-10*n)*x^2)*P(n-2,x) - ((2*n+2)*x-(4*n^2+12*n+10)*x^2-(4*n^3-32*n^2-18*n)*x^3)*d/dx P(n-2,x) - ((n+1)*x^2-(4*n^2+4*n+2)*x^3+(8*n^2+4*n)*x^4)*d^2/dx^2 P(n-2,x) + (n+(4*n^2-4*n)*x)*P(n-1,x) + ((2*n+1)*x-(4*n^2+4*n)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-((4*n^2 - 4*n - 8)*x - (9*n^3 - 13*n^2 - 10*n)*x^2)*P[n - 2, x] - ((2*n + 2)*x - (4*n^2 + 12*n + 10)*x^2 - (4*n^3 - 32*n^2 - 18*n)*x^3)*D[P[n - 2, x], x] - ((n + 1)*x^2 - (4*n^2 + 4*n + 2)*x^3 + (8*n^2 + 4*n)*x^4)*D[P[n - 2, x], {x, 2}] + (n + (4*n^2 - 4*n)*x)*P[n - 1, x] + ((2*n + 1)*x - (4*n^2 + 4*n)*x^2)*D[P[n - 1, x], x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (-((4*n^2 - 4*n - 8)*x - (9*n^3 - 13*n^2 - 10*n)*x^2)*v[i - 2] - ((2*n + 2)*x - (4*n^2 + 12*n + 10)*x^2 - (4*n^3 - 32*n^2 - 18*n)*x^3)*deriv(v[i - 2], x) - ((n + 1)*x^2 - (4*n^2 + 4*n + 2)*x^3 + (8*n^2 + 4*n)*x^4)*deriv(deriv(v[i - 2], x), x) + (n + (4*n^2 - 4*n)*x)*v[i - 1] + ((2*n + 1)*x - (4*n^2 + 4*n)*x^2)*deriv(v[i - 1], x))/(n)); 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-ff270bcb802a85af","steps":["\u03b3 (scale 1/2) (shift +1)","(\u03b8+1)\u00b2"],"edges":["e-ea229ed6e1820773","e-e49355d6c48303b1"],"text":"A008292 \u2192 \u03b3 (scale 1/2) (shift +1) \u2192 (\u03b8+1)\u00b2"},"headline":"A008292 \u2192 \u03b3 (scale 1/2) (shift +1) \u2192 (\u03b8+1)\u00b2","chain":null}