{"id":"n-e1a2b20716b1e97c","revision":0,"first_index":0,"fingerprint":"f6-08e5ad0dcb445c93","name":"shift_x_plus_one of basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","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"],["6","3"],["41","39","9"],["306","423","189","27"],["2426","4380","2880","810","81"],["20076","44670","38700","16200","3240","243"],["171481","453213","486945","270675","81405","12393","729"],["1500666","4591839","5887539","4081455","1641465","379323","45927","2187"],["13386206","46533288","69323184","57589812","29031534","9028908","1673784","166212","6561"],["121267476","471993210","801086760","775746720","470414952","184228506","46233180","7085880","590490","19683"],["1112674026","4793231790","9129541050","10098051300","7159100760","3384432072","1074079440","224058150","29032425","2066715","59049"],["10318939956","48739798998","102941794890","128046901950","103936771620","57602786472","22138406136","5863172040","1039262400","115834455","7144929","177147"],["96572168916","496252543464","1151027643744","1590406006860","1454594396310","925021865592","417835063008","134414734608","30359452860","4650699240","452079144","24446286","531441"],["910896992856","5059024107228","12783106804104","19425524790672","19767739799808","14190206512482","7370046900216","2793142411488","768449671704","150517239444","20198064744","1731789072","82904796","1594323"],["8650566601401","51635449205865","141178262126265","234011561479605","262260927441513","209785862078793","123202004230305","53790656074155","17473422931965","4179943901133","719522280477","85518599985","6528752685","279006525","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","89","945","10577","123129","1476841","18130401","226739489","2878666857","37006326777","480750990993","6301611631473","83240669582937","1106980509493641"],"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":{"denominator":{"coeffs":[["6"],["3"]]},"terms":[{"coeff":{"coeffs":[["6","0"],["48","27"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-40","-54","-18"]]},"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-828cb1728507cda8","recurrence":{"first_index":0,"initial_polynomials":[["1"],["6","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["16","24","9"],["-16","-24","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6","3"],["12","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":183384,"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-518e5bacf2d8f513"]},{"id":183385,"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-518e5bacf2d8f513","e-cf503f5f6b27e893"]},{"id":183386,"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-518e5bacf2d8f513","e-cf503f5f6b27e893"]},{"id":183387,"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-cf503f5f6b27e893"]},{"id":183388,"position":4,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-cf503f5f6b27e893"]}],"region_exact":{},"incoming_edges":[{"id":"e-cf503f5f6b27e893","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-e1a2b20716b1e97c","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":"6648fb762c262069d42f8e928a6f710489b957cc8df00dbb4cf42f5fbc12ff4f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-cbba416b5dae7a51","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","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-828cb1728507cda8","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-e1a2b20716b1e97c","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":"6bc22fee32e58758c25075dd4458ad4d755ca5f6eef810a96742ee5fd6cc1096","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-518e5bacf2d8f513","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-e1a2b20716b1e97c","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":"2d91bed535035093c9b428a10ac59620dfa6d8ee71c97c5c87cf5860c365b984","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-cbba416b5dae7a51","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","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:         6,         3;\n  2:        41,        39,         9;\n  3:       306,       423,       189,        27;\n  4:      2426,      4380,      2880,       810,        81;\n  5:     20076,     44670,     38700,     16200,      3240,       243;\n  6:    171481,    453213,    486945,    270675,     81405,     12393,      729;\n  7:   1500666,   4591839,   5887539,   4081455,   1641465,    379323,    45927,    2187;\n  8:  13386206,  46533288,  69323184,  57589812,  29031534,   9028908,  1673784,  166212,   6561;\n  9: 121267476, 471993210, 801086760, 775746720, 470414952, 184228506, 46233180, 7085880, 590490, 19683;\n","recurrence_sentence":"The row polynomials satisfy (3*n+6)*P(n,x) = (48*n+6+27*n*x)*P(n-1,x) - (40+54*x+18*x^2)*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[Together[((48*n + 6 + 27*n*x)*P[n - 1, x] - (40 + 54*x + 18*x^2)*D[P[n - 1, x], x])/(3*n + 6)]];\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] = ((48*n + 6 + 27*n*x)*v[i - 1] - (40 + 54*x + 18*x^2)*deriv(v[i - 1], x))/(3*n + 6)); 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-57b4b14604f4c0d7","steps":["basis A013610","x \u21a6 x+1"],"edges":["e-125d456539fb62ba","e-518e5bacf2d8f513"],"text":"A126216 \u2192 basis A013610 \u2192 x \u21a6 x+1"},"headline":"A126216 \u2192 basis A013610 \u2192 x \u21a6 x+1","chain":null}