{"id":"n-e62346b6c3ea7c97","revision":0,"first_index":0,"fingerprint":"f6-3625a02740bd6ebd","name":"theta_plus_one of Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1)} and m = 3.","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"],["0","2"],["0","8","3"],["0","56","36","4"],["0","560","480","96","5"],["0","7280","7560","2080","200","6"],["0","116480","139440","47520","6400","360","7"],["0","2213120","2963520","1183840","200200","15960","588","8"],["0","48688640","71480640","32363520","6484800","655200","34496","896","9"],["0","1217216000","1931529600","969122560","222028800","26782560","1799280","67200","1296","10"],["0","34082048000","57840182400","31649049600","8094296000","1123476480","90622560","4341120","120960","1800","11"],["0","1056543488000","1902008908800","1121538880000","314767376000","49034832000","4573134720","264190080","9480240","204600","2420","12"],["0","35922478592000","68155127040000","42911411558400","13048316512000","2241044467200","235559558080","15794042880","685903680","19126800","329120","3168","13"],["0","1329131707904000","2643778545408000","1764418553497600","575571924928000","107540802969600","12508053317760","948354767360","47948060160","1622821200","36179000","507936","4056","14"],["0","53165268316160000","110388617923584000","77630617307443200","26955115963776000","5422481640576000","688326669430400","57919237376000","3320457940800","131171040000","3557874320","64864800","757120","5096","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","11","96","1141","17126","310207","6577236","159708201","4368547306","132884138931","4448740496872","162530437133341","6433947550364686","274311802310827751"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-42","14","-1"],["39","-6","0"],["-9","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","7","-1"],["0","-3","0"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-10","2"],["6","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185260,"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-06ef5d94503acd62"]},{"id":185261,"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-06ef5d94503acd62"]},{"id":185262,"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-06ef5d94503acd62"]}],"region_exact":{},"incoming_edges":[{"id":"e-06ef5d94503acd62","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-e62346b6c3ea7c97","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":"653c29e0bd0d04e9f66028fb2378e25c1a9b5fcc02698438f5a9de390f4f82ef","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-706703e52ab62d2a","role":"sequence","name":"Triangle read by rows: BellMatrix(Product_{p in P(n)} p), where P(n) = {k : k mod m = 1 and 1 <= k <= m*(n + 1)} and m = 3.","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: 0,          2;\n  2: 0,          8,          3;\n  3: 0,         56,         36,         4;\n  4: 0,        560,        480,        96,         5;\n  5: 0,       7280,       7560,      2080,       200,        6;\n  6: 0,     116480,     139440,     47520,      6400,      360,       7;\n  7: 0,    2213120,    2963520,   1183840,    200200,    15960,     588,     8;\n  8: 0,   48688640,   71480640,  32363520,   6484800,   655200,   34496,   896,    9;\n  9: 0, 1217216000, 1931529600, 969122560, 222028800, 26782560, 1799280, 67200, 1296, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(9*n^2-39*n+42+(6*n-14)*x+x^2)*P(n-2,x) - ((3*n-7)*x+x^2)*d/dx P(n-2,x) + (6*n-10+2*x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[-(9*n^2 - 39*n + 42 + (6*n - 14)*x + x^2)*P[n - 2, x] - ((3*n - 7)*x + x^2)*D[P[n - 2, x], x] + (6*n - 10 + 2*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 39*n + 42 + (6*n - 14)*x + x^2)*v[i - 2] - ((3*n - 7)*x + x^2)*deriv(v[i - 2], x) + (6*n - 10 + 2*x)*v[i - 1] + x*deriv(v[i - 1], x)); 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-706703e52ab62d2a","steps":["\u03b8+1"],"edges":["e-06ef5d94503acd62"],"text":"A371080 \u2192 \u03b8+1"},"headline":"A371080 \u2192 \u03b8+1","chain":null}