{"id":"n-d368e3a5475fdf12","revision":0,"first_index":0,"fingerprint":"f6-e1569aa88e2ddeff","name":"shift_x_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"],["1","1"],["5","6","1"],["41","55","15","1"],["465","676","238","28","1"],["6721","10405","4330","690","45","1"],["117941","192266","90415","17620","1595","66","1"],["2433145","4144091","2143841","484435","54635","3185","91","1"],["57673281","102034920","57049580","14473256","1920870","141176","5740","120","1"],["1543866945","2824680361","1685793348","469984228","70884366","6190590","319956","9588","153","1"],["46052954821","86831184110","54808433485","16538841880","2769236890","277093572","17136210","656760","15105","190","1"],["1514472783561","2934267713311","1945126014755","628206004965","114847600890","12847422742","915730662","42213930","1247565","22715","231","1"],["54426342354385","108104094778956","74843422259386","25648138602020","5056651952495","621391471800","49772146732","2656482312","94816095","2226620","32890","276","1"],["2121878761891201","4312068788473485","3103941978701070","1120995574150166","236077826013315","31453726648487","2780189157460","167415897220","6943246167","197569515","3775486","46150","325","1"],["89187219264121525","185124583046706226","138040618616368923","52251062971211468","11665688551978461","1668176660139990","160514339172187","10704282296136","502469838871","16661907262","386851465","6133036","63063","378","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","12","112","1408","22192","419904","9263424","233298944","6601729536","207295553024","7150726755328","268752567123968","10929371405570048","478109087256788992"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-2","1"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185266,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-0dc07e68ceb7043a"]},{"id":185267,"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-0dc07e68ceb7043a"]},{"id":185268,"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-0dc07e68ceb7043a"]}],"region_exact":{},"incoming_edges":[{"id":"e-0dc07e68ceb7043a","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-d368e3a5475fdf12","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"e7c7aeb696c7b9627fa8438cbc3df1f76a8f3ddd9774fa9fece2010e061725b1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"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:          1,          1;\n  2:          5,          6,          1;\n  3:         41,         55,         15,         1;\n  4:        465,        676,        238,        28,        1;\n  5:       6721,      10405,       4330,       690,       45,       1;\n  6:     117941,     192266,      90415,     17620,     1595,      66,      1;\n  7:    2433145,    4144091,    2143841,    484435,    54635,    3185,     91,    1;\n  8:   57673281,  102034920,   57049580,  14473256,  1920870,  141176,   5740,  120,   1;\n  9: 1543866945, 2824680361, 1685793348, 469984228, 70884366, 6190590, 319956, 9588, 153, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n-2+x)*P(n-1,x) + (1+x)*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[(3*n - 2 + x)*P[n - 1, x] + (1 + 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; for(n = 1, N, my(i = n + 1); v[i] = (3*n - 2 + x)*v[i - 1] + (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":["x \u21a6 x+1"],"edges":["e-0dc07e68ceb7043a"],"text":"A371080 \u2192 x \u21a6 x+1"},"headline":"A371080 \u2192 x \u21a6 x+1","chain":null}