{"id":"n-7443809b677f8653","revision":0,"first_index":1,"fingerprint":"f6-42186a769c41ebed","name":"shift_x_plus_one of basis_map_A013610 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["6","3"],["46","42","9"],["396","522","216","27"],["3606","6228","3834","972","81"],["33876","72450","59400","22950","4050","243"],["324556","828108","849150","442800","121500","16038","729"],["3151896","9345252","11509344","7569450","2835000","591948","61236","2187"],["30915046","104454312","150212916","119343672","56785050","16343208","2714796","227448","6561"],["305543556","1158850098","1906051824","1775819052","1025968356","377550558","87200064","11888532","826686","19683"],["3038019876","12780582300","23664745350","25299604800","17205955200","7723512972","2294053650","438274800","50191650","2952450","59049"],["30354866856","140272922988","288758487600","348431742450","272720844000","144606691152","52611889176","12994388550","2100176100","205687350","10392624","177147"],["304523343996","1533394121112","3473972508204","4670201269800","4135592760750","2530590856992","1091012663664","331337638368","69565626900","9678131100","822316374","36137988","531441"],["3065412858696","16705674315252","41306298327216","61220562609492","60515949908700","41986105357482","20941857915264","7558609707792","1958266551384","355492694700","43165763784","3219469578","124357194","1594323"],["30946859111256","181475744293368","486296104985964","787775207742432","859906327336056","667175687310132","378079727271246","158242282406208","48856506602904","10980384046632","1746997496244","187254299232","12380449536","424089918","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","97","1161","14721","192969","2582881","35066313","481003009","6649718409","92497952097","1293068265993","18150727906689","255660741430857","3611681892224097"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-3"],["3"]]},"terms":[{"coeff":{"coeffs":[["-78","-45"],["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-7fa92f96a89db90b","recurrence":{"first_index":1,"initial_polynomials":[["1"],["6","3"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-32","-48","-18"],["16","24","9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["18","9"],["-12","-6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184850,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-b3e4dac45e7eb50b"]},{"id":184851,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-b3e4dac45e7eb50b","e-fa78736ad49289fd"]},{"id":184852,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-b3e4dac45e7eb50b","e-fa78736ad49289fd"]},{"id":184853,"position":3,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-fa78736ad49289fd"]},{"id":184854,"position":4,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-fa78736ad49289fd"]}],"region_exact":{},"incoming_edges":[{"id":"e-fa78736ad49289fd","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-7443809b677f8653","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":"76b8b94604c84fea422cf824f17ec3ad7b279a6bc9659b1f8c0c7b738bcdebdc","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-914a474e9f3b0e2a","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]},{"id":"e-7fa92f96a89db90b","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-7443809b677f8653","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":"2c3c5cae1e0532f638643efadbba05b27b2124d9d20c665f48ae128db70ef5d6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-b3e4dac45e7eb50b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-7443809b677f8653","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":"b16ce039d7442e29ea147fc911161d572b8b7085c1d36cd8a2490ee5bab9d507","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-914a474e9f3b0e2a","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, 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":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:         1;\n   2:         6,          3;\n   3:        46,         42,          9;\n   4:       396,        522,        216,         27;\n   5:      3606,       6228,       3834,        972,         81;\n   6:     33876,      72450,      59400,      22950,       4050,       243;\n   7:    324556,     828108,     849150,     442800,     121500,     16038,      729;\n   8:   3151896,    9345252,   11509344,    7569450,    2835000,    591948,    61236,     2187;\n   9:  30915046,  104454312,  150212916,  119343672,   56785050,  16343208,  2714796,   227448,   6561;\n  10: 305543556, 1158850098, 1906051824, 1775819052, 1025968356, 377550558, 87200064, 11888532, 826686, 19683;\n","recurrence_sentence":"The row polynomials satisfy (3*n-3)*P(n,x) = (48*n-78+(27*n-45)*x)*P(n-1,x) - (40+54*x+18*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((48*n - 78 + (27*n - 45)*x)*P[n - 1, x] - (40 + 54*x + 18*x^2)*D[P[n - 1, x], x])/(3*n - 3)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((48*n - 78 + (27*n - 45)*x)*v[i - 1] - (40 + 54*x + 18*x^2)*deriv(v[i - 1], x))/(3*n - 3)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["basis A013610","x \u21a6 x+1"],"edges":["e-35b37e0190870340","e-b3e4dac45e7eb50b"],"text":"A104684 \u2192 basis A013610 \u2192 x \u21a6 x+1"},"headline":"A104684 \u2192 basis A013610 \u2192 x \u21a6 x+1","chain":null}