{"id":"n-7fbdda6d907a2282","revision":0,"first_index":1,"fingerprint":"f6-a747911520942d51","name":"shift_x_plus_one of basis_map_A007318 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"],["4","1"],["22","10","1"],["136","90","18","1"],["886","772","234","28","1"],["5944","6430","2620","490","40","1"],["40636","52524","26910","6880","900","54","1"],["281488","423220","261324","84910","15400","1512","70","1"],["1968934","3375880","2439892","962584","223930","30856","2380","88","1"],["13875544","26720118","22127256","10274292","2921184","520506","56952","3564","108","1"],["98365972","210195100","196226550","104839200","35254800","7722540","1100610","98640","5130","130","1"],["700701808","1645295212","1709497900","1033089750","401266800","104421240","18392220","2161170","162360","7150","154","1"],["5011371964","12825551160","14679251532","9900305800","4362915150","1315971360","276479280","40344480","3997620","256300","9702","180","1"],["35961808432","99633196780","124548110856","92740316812","45725851600","15692300910","3833612640","669754800","82779840","7038460","390676","12870","208","1"],["258805997752","771702434104","1046135336428","852420290176","464990197672","178954315540","49871211390","10161328320","1508827320","160680520","11887876","578032","16744","238","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","33","245","1921","15525","127905","1067925","9004545","76499525","653808673","5614995765","48416454529","418895174885","3634723102113"],"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":[["-16","-5"],["10","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-12","-10","-2"]]},"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-d5b983027f36fb5d","recurrence":{"first_index":1,"initial_polynomials":[["1"],["4","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-8","-8","-2"],["4","4","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["12","3"],["-8","-2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181142,"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-11e97b68415c1154"]},{"id":181143,"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-11e97b68415c1154","e-ef3510c492115188"]},{"id":181144,"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-11e97b68415c1154","e-ef3510c492115188"]},{"id":181145,"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-ef3510c492115188"]},{"id":181146,"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-ef3510c492115188"]}],"region_exact":{},"incoming_edges":[{"id":"e-ef3510c492115188","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-7fbdda6d907a2282","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":"33a46dacdf3afc13343f1661b05c58795ee10ccfdd6cecd5cf43e9280cf74e99","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-118f91023ad73cd8","role":"sequence","name":"basis_map_A007318 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-d5b983027f36fb5d","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-7fbdda6d907a2282","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":"1aeb170c3c89469ec5a6c7c64c7433b37656327357bd5e56f1316a1cc4b02b93","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-11e97b68415c1154","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-7fbdda6d907a2282","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":"01e25fd2a29c8feb5acebb492273ee46604c7ef8dacb2f26143a27657cea5d0a","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-118f91023ad73cd8","role":"sequence","name":"basis_map_A007318 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:        4,        1;\n   3:       22,       10,        1;\n   4:      136,       90,       18,        1;\n   5:      886,      772,      234,       28,       1;\n   6:     5944,     6430,     2620,      490,      40,      1;\n   7:    40636,    52524,    26910,     6880,     900,     54,     1;\n   8:   281488,   423220,   261324,    84910,   15400,   1512,    70,    1;\n   9:  1968934,  3375880,  2439892,   962584,  223930,  30856,  2380,   88,   1;\n  10: 13875544, 26720118, 22127256, 10274292, 2921184, 520506, 56952, 3564, 108, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (10*n-16+(3*n-5)*x)*P(n-1,x) - (12+10*x+2*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[((10*n - 16 + (3*n - 5)*x)*P[n - 1, x] - (12 + 10*x + 2*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] = ((10*n - 16 + (3*n - 5)*x)*v[i - 1] - (12 + 10*x + 2*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 A007318","x \u21a6 x+1"],"edges":["e-32321abfdad5764e","e-11e97b68415c1154"],"text":"A104684 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A104684 \u2192 basis A007318 \u2192 x \u21a6 x+1","chain":null}