{"id":"n-b8c7876a249ffefc","revision":0,"first_index":0,"fingerprint":"f6-c654e1ec9ab2ab59","name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","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"],["2","2"],["5","9","4"],["14","36","30","8"],["41","138","169","88","16"],["122","510","830","650","240","32"],["365","1827","3723","3921","2220","624","64"],["1094","6384","15652","20776","15974","7000","1568","128"],["3281","21876","62726","100580","98001","58800","20832","3840","256"],["9842","73818","242388","455796","538362","411282","200928","59328","9216","512"],["29525","246045","910390","1964410","2727665","2533849","1582740","648480","163200","21760","1024"],["88574","811932","3342482","8139824","12993090","14220492","10831150","5695272","2000064","436480","50688","2048"],["265721","2657214","12046071","32679084","58956231","74301486","66810745","42945672","19421424","5944576","1140480","116736","4096"],["797162","8635926","42747874","127836046","257213294","366858466","380439670","289239834","160276688","63373024","17132544","2921984","266240","8192"],["2391485","27900663","149733605","489347075","1086390795","1729972629","2032824983","1784999841","1171939132","569032464","199303104","48106240","7361536","602112","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","18","88","452","2384","12744","68576","370192","2001472","10829088","58612096","317289536","1717746944","9299922048"],"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"],["2","2"]],"recurrence":{"denominator":{"coeffs":[["-2"],["2"]]},"terms":[{"coeff":{"coeffs":[["-11","-12"],["11","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-6","-14","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":"e-6aae761843f53e9e","recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","-7","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":173739,"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-68445ac649799166"]},{"id":173740,"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-68445ac649799166","e-d8004c7e185a4c2a"]},{"id":173741,"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-68445ac649799166","e-d8004c7e185a4c2a"]},{"id":173742,"position":3,"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-d8004c7e185a4c2a"]}],"region_exact":{},"incoming_edges":[{"id":"e-d8004c7e185a4c2a","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-b8c7876a249ffefc","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"6f135a5d93dabf04ef055b92e0ca1b946bb4cd4e32075941cfb8b7e14a74e44b","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-5576233c61c40153","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","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]"}]},{"id":"e-6aae761843f53e9e","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-b8c7876a249ffefc","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"76324276a28719d3e6ea68d76afcf3f6c71411df5e4d0e70939d919dca8cea38","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-68445ac649799166","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-b8c7876a249ffefc","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":"d87ca18ce82ece6bddf148d8a799c90673cf444c5a41065746b21ae929602fd9","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-5576233c61c40153","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","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:    2,     2;\n  2:    5,     9,      4;\n  3:   14,    36,     30,      8;\n  4:   41,   138,    169,     88,     16;\n  5:  122,   510,    830,    650,    240,     32;\n  6:  365,  1827,   3723,   3921,   2220,    624,     64;\n  7: 1094,  6384,  15652,  20776,  15974,   7000,   1568,   128;\n  8: 3281, 21876,  62726, 100580,  98001,  58800,  20832,  3840,  256;\n  9: 9842, 73818, 242388, 455796, 538362, 411282, 200928, 59328, 9216, 512;\n","recurrence_sentence":"The row polynomials satisfy (2*n-2)*P(n,x) = (11*n-11+(12*n-12)*x)*P(n-1,x) - (6+14*x+8*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[((11*n - 11 + (12*n - 12)*x)*P[n - 1, x] - (6 + 14*x + 8*x^2)*D[P[n - 1, x], x])/(2*n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((11*n - 11 + (12*n - 12)*x)*v[i - 1] - (6 + 14*x + 8*x^2)*deriv(v[i - 1], x))/(2*n - 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-5576233c61c40153","steps":["x \u21a6 x+1"],"edges":["e-68445ac649799166"],"text":"A372873 \u2192 x \u21a6 x+1"},"headline":"A372873 \u2192 x \u21a6 x+1","chain":null}