{"id":"n-669d4405c319a323","revision":0,"first_index":1,"fingerprint":"f6-20efcd8d91464382","name":"shift_x_plus_one of basis_map_A013611 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"],["7","4"],["61","64","16"],["595","900","432","64"],["6145","12160","8640","2560","256"],["65527","160420","151360","67840","14080","1024"],["712909","2081088","2451600","1477120","472320","73728","4096"],["7863667","26665828","37688112","28571200","12409600","3032064","372736","16384"],["87615745","338490880","558202624","510404608","280806400","94044160","18350080","1835008","65536"],["983726695","4265416260","8040695040","8612029440","5741632512","2450165760","660602880","106168320","8847360","262144"],["11112210781","53436147520","113351510160","139195607040","109084308480","56648761344","19565199360","4376494080","592773120","41943040","1048576"],["126142119187","666244968004","1570688350000","2175593555520","1960099384320","1200302788608","506427457536","145819238400","27671592960","3215196160","196083712","4194304"],["1437751935361","8273850125184","21461336842176","33101306022400","33711374188800","23791996698624","11871496175616","4190484824064","1028195942400","168401305600","17024679936","905969664","16777216"],["16443380994775","102405942910180","289838121797952","492641133048064","559671861548800","447391102878720","257869141770240","107938105786368","32573383704576","6926585036800","992644956160","88332042240","4143972352","67108864"],["188609259215725","1263855432884800","3875918422339600","7198065061358080","9025027885409536","8061006738104320","5272390466703360","2554739172311040","916514139340800","240431203876864","44908187484160","5694690426880","450384363520","18790481920","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","11","141","1991","29761","460251","7272861","116619591","1889815041","30869546411","507406003501","8382404928711","139054141487041","2314783947556091","38647630102736061"],"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":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-31","-20"],["19","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-15","-22","-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-94ca338fcc0ee6de","recurrence":{"first_index":1,"initial_polynomials":[["1"],["7","4"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-50","-80","-32"],["25","40","16"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["21","12"],["-14","-8"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185609,"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-da67df2d35b41a14"]},{"id":185610,"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-60cc5e1acbaf94c6","e-da67df2d35b41a14"]},{"id":185611,"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-60cc5e1acbaf94c6","e-da67df2d35b41a14"]},{"id":185612,"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-60cc5e1acbaf94c6"]},{"id":185613,"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-60cc5e1acbaf94c6"]}],"region_exact":{},"incoming_edges":[{"id":"e-60cc5e1acbaf94c6","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-669d4405c319a323","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":"dd8a1bc78f5e15a21099bebeac1f300770657c54821c71bb260b689cc7543b7e","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-6373ae06480cbab5","role":"sequence","name":"basis_map_A013611 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-94ca338fcc0ee6de","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-669d4405c319a323","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":"a256c1ff79fc116a6011b508577d6140ef0945d0b6f0263189a85ac40b137a72","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-da67df2d35b41a14","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-669d4405c319a323","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":"abf9dd7b838f0a56f0e8e3ef9b141d060914c09c7bb5876f9ff45b4c744a7343","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-6373ae06480cbab5","role":"sequence","name":"basis_map_A013611 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":[{"id":"l-656e48c851dfee72","kind":"fingerprint_related","node_a_id":"n-669d4405c319a323","node_b_id":"n-0a43d0b65760bf28","fingerprint":"f6-20efcd8d91464382","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-20efcd8d91464382"},"other_id":"n-0a43d0b65760bf28","other":{"id":"n-0a43d0b65760bf28","name":"shift_x_plus_one of basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-20efcd8d91464382","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["61","64","16"],["595","900","432","64"],["6145","12160","8640","2560","256"]],"card_rows":[["61","64","16"],["595","900","432","64"],["6145","12160","8640","2560","256"],["65527","160420","151360","67840","14080","1024"]],"row_sums_preview":["141","1991","29761","460251","7272861","116619591","1889815041","30869546411"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609","x \u21a6 x+1"],"edges":["e-060b1f8a928003b3","e-5d4997675f83cbf1"],"text":"A133214 \u2192 basis A013609 \u2192 x \u21a6 x+1"},"headline":"A133214 \u2192 basis A013609 \u2192 x \u21a6 x+1","chain":null}}],"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:         7,          4;\n   3:        61,         64,         16;\n   4:       595,        900,        432,         64;\n   5:      6145,      12160,       8640,       2560,        256;\n   6:     65527,     160420,     151360,      67840,      14080,       1024;\n   7:    712909,    2081088,    2451600,    1477120,     472320,      73728,      4096;\n   8:   7863667,   26665828,   37688112,   28571200,   12409600,    3032064,    372736,     16384;\n   9:  87615745,  338490880,  558202624,  510404608,  280806400,   94044160,  18350080,   1835008,   65536;\n  10: 983726695, 4265416260, 8040695040, 8612029440, 5741632512, 2450165760, 660602880, 106168320, 8847360, 262144;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (19*n-31+(12*n-20)*x)*P(n-1,x) - (15+22*x+8*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[((19*n - 31 + (12*n - 20)*x)*P[n - 1, x] - (15 + 22*x + 8*x^2)*D[P[n - 1, x], x])/(n - 1)]];\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] = ((19*n - 31 + (12*n - 20)*x)*v[i - 1] - (15 + 22*x + 8*x^2)*deriv(v[i - 1], x))/(n - 1)); 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 A013611","basis A007318"],"edges":["e-99f7e1fd97b5ca9c","e-60cc5e1acbaf94c6"],"text":"A104684 \u2192 basis A013611 \u2192 basis A007318"},"headline":"A104684 \u2192 basis A013611 \u2192 basis A007318","chain":null}