{"id":"n-118f91023ad73cd8","revision":2,"first_index":1,"fingerprint":"f6-c880512e8efe320e","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.","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"],["3","1"],["13","8","1"],["63","57","15","1"],["321","384","156","24","1"],["1683","2505","1380","340","35","1"],["8989","16008","11145","3800","645","48","1"],["48639","100849","84903","37065","8855","1113","63","1"],["265729","628736","621040","330848","102340","18368","1792","80","1"],["1462563","3888657","4408848","2774352","1055628","247716","34944","2736","99","1"],["8097453","23900040","30589065","22209120","10041780","2919168","543060","62160","4005","120","1"],["45046719","146146473","208411335","171521625","89899260","31222884","7241388","1101540","104775","5665","143","1"],["251595969","889928064","1399199868","1287357720","767708865","310394304","86427264","16484688","2098305","168960","7788","168","1"],["1409933619","5399971161","9279936900","9439841268","6312758595","2913982929","948220416","218103600","34992243","3794505","262548","10452","195","1"],["7923848253","32668236552","60919688193","67892966232","50326289013","26124706608","9736383657","2626557648","510266757","70078008","6567561","395304","13741","224","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","22","136","886","5944","40636","281488","1968934","13875544","98365972","700701808","5011371964","35961808432","258805997752"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["-1"]]},"terms":[{"coeff":{"coeffs":[["-2","-4","-2"],["1","2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","3"],["-6","-2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":"e-0a47be968c31d18b","recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-11","-5"],["7","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4","-6","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161842,"position":0,"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-7b1b09c6fd205866"]},{"id":161843,"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-7b1b09c6fd205866","e-da18ebef7a232130"]},{"id":161844,"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-7b1b09c6fd205866","e-da18ebef7a232130"]},{"id":161845,"position":3,"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-7b1b09c6fd205866","e-da18ebef7a232130"]},{"id":161846,"position":4,"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-da18ebef7a232130"]}],"region_exact":{},"incoming_edges":[{"id":"e-7b1b09c6fd205866","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-118f91023ad73cd8","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":"0a42aa56ebd448f634abef3254b315b3339d6f76f81461560120c1058107ec49","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-78ba05b4a3dd925d","role":"sequence","name":"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-0a47be968c31d18b","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-118f91023ad73cd8","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":"6c5cdb246dd16c5ad1ff655ece80aa41ee9df2c55fea7e67e4d41d6cca4ce45d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-da18ebef7a232130","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-118f91023ad73cd8","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":"5952220ff736faadbddfe678b24469ff3382624c900a1bea053aef54ae16db41","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-78ba05b4a3dd925d","role":"sequence","name":"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-1301398b1b5347ac","kind":"fingerprint_related","node_a_id":"n-118f91023ad73cd8","node_b_id":"n-939b76c3ba274588","fingerprint":"f6-c880512e8efe320e","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c880512e8efe320e"},"other_id":"n-939b76c3ba274588","other":{"id":"n-939b76c3ba274588","name":"mobius_x_over_x_plus_one of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","first_index":1,"fingerprint":"f6-c880512e8efe320e","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","3"],["1","8","13"]],"card_rows":[["1"],["1","3"],["1","8","13"],["1","15","57","63"]],"row_sums_preview":["1","4","22","136","886","5944","40636","281488"],"regions":["[-1, 0)"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4689fb1386d440ad","steps":["x \u21a6 x/(x+1)"],"edges":["e-7f33caeda894b198"],"text":"A063007 \u2192 x \u21a6 x/(x+1)"},"headline":"A063007 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-118152321876f362","kind":"oeis_match","node_a_id":"n-118f91023ad73cd8","node_b_id":null,"fingerprint":null,"oeis_id":"A069835","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A069835","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A069835","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-118f91023ad73cd8","oeis_id":"A069835","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":23,"oeis_terms_available":23,"term_count":200,"raw_size":18130}],"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:       3,       1;\n   3:      13,       8,       1;\n   4:      63,      57,      15,       1;\n   5:     321,     384,     156,      24,       1;\n   6:    1683,    2505,    1380,     340,      35,      1;\n   7:    8989,   16008,   11145,    3800,     645,     48,     1;\n   8:   48639,  100849,   84903,   37065,    8855,   1113,    63,    1;\n   9:  265729,  628736,  621040,  330848,  102340,  18368,  1792,   80,  1;\n  10: 1462563, 3888657, 4408848, 2774352, 1055628, 247716, 34944, 2736, 99, 1;\n","recurrence_sentence":"The row polynomials satisfy -(n-1)*P(n,x) = (n-2+(2*n-4)*x+(n-2)*x^2)*P(n-2,x) - (6*n-9+(2*n-3)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (2*n - 4)*x + (n - 2)*x^2)*P[n - 2, x] - (6*n - 9 + (2*n - 3)*x)*P[n - 1, x])/(-n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = ((n - 2 + (2*n - 4)*x + (n - 2)*x^2)*v[i - 2] - (6*n - 9 + (2*n - 3)*x)*v[i - 1])/(-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"],"edges":["e-7b1b09c6fd205866"],"text":"A104684 \u2192 basis A007318"},"headline":"A104684 \u2192 basis A007318","chain":null}