{"id":"n-dc4b31093d14e956","revision":0,"first_index":0,"fingerprint":"f6-23dfd276d7990904","name":"theta_plus_one_squared of reversal of Number triangle T(n,k)=C(n,k)C(2,n-k).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","8"],["1","16","9"],["1","24","27"],["1","32","54"],["1","40","90"],["1","48","135"],["1","56","189"],["1","64","252"],["1","72","324"],["1","80","405"],["1","88","495"],["1","96","594"],["1","104","702"],["1","112","819"]],"degrees":[0,1,2,2,2,2,2,2,2,2,2,2,2,2,2],"row_sums":["1","9","26","52","87","131","184","246","317","397","486","584","691","807","932"],"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","8"],["1","16","9"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":171278,"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-1ec2f2440b13c259"]},{"id":171279,"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-1ec2f2440b13c259"]},{"id":171280,"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-1ec2f2440b13c259"]}],"region_exact":{},"incoming_edges":[{"id":"e-1ec2f2440b13c259","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-dc4b31093d14e956","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":"0fc482367fad1dfaf0b37fb13b07b8ae881ccfe6cc95b42dec75d961ff3cf2ef","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-88b9d8361c4b11db","role":"sequence","name":"reversal of Number triangle T(n,k)=C(n,k)C(2,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,  8;\n  2: 1, 16,   9;\n  3: 1, 24,  27;\n  4: 1, 32,  54;\n  5: 1, 40,  90;\n  6: 1, 48, 135;\n  7: 1, 56, 189;\n  8: 1, 64, 252;\n  9: 1, 72, 324;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-3,x) - 3*P(n-2,x) + 3*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + 8*x, P(2,x) = 1 + 16*x + 9*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 8*x;\nP[2, x_] := 1 + 16*x + 9*x^2;\nP[n_, x_] := P[n, x] = Expand[P[n - 3, x] - 3*P[n - 2, x] + 3*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 8*x; v[3] = 1 + 16*x + 9*x^2; for(n = 3, N, my(i = n + 1); v[i] = v[i - 3] - 3*v[i - 2] + 3*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-1815d3e1c9c57d5b","steps":["reverse","(\u03b8+1)\u00b2"],"edges":["e-29732eeeac05382b","e-1ec2f2440b13c259"],"text":"A106246 \u2192 reverse \u2192 (\u03b8+1)\u00b2"},"headline":"A106246 \u2192 reverse \u2192 (\u03b8+1)\u00b2","chain":null}