{"id":"n-500943bf802dcc95","revision":2,"first_index":1,"fingerprint":"f6-21068b267380f889","name":"basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":false,"rows":[["1"],["-1","1"],["0","-1","1"],["1","-1","-1","1"],["-1","3","-2","-1","1"],["0","-2","5","-3","-1","1"],["1","-2","-2","7","-4","-1","1"],["-1","5","-7","-1","9","-5","-1","1"],["0","-3","12","-15","1","11","-6","-1","1"],["1","-3","-3","21","-26","4","13","-7","-1","1"],["-1","7","-15","3","31","-40","8","15","-8","-1","1"],["0","-4","22","-42","19","41","-57","13","17","-9","-1","1"],["1","-4","-4","46","-89","49","50","-77","19","19","-10","-1","1"],["-1","9","-26","14","74","-160","97","57","-100","26","21","-11","-1","1"],["0","-5","35","-90","75","96","-258","167","61","-126","34","23","-12","-1","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","0","0","0","0","0","0","0","0","0","0","0","0","0","0"],"nonn":false,"definitions":[{"position":0,"source":"derived:basis_map_coefficients_of:oeis_catalog:A026729","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["-1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160000,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-3, 1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":true,"value":"1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-3, 1]","region_exact":null,"edges":["e-1365676e8cb0fd13","e-3c4e27dedb9c54a8"]},{"id":160001,"position":1,"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-1365676e8cb0fd13","e-3c4e27dedb9c54a8"]}],"region_exact":{},"incoming_edges":[{"id":"e-1365676e8cb0fd13","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-2\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-500943bf802dcc95","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":"a9e284e161e9b1783afcf035cd8f19e3090b33322a69654df29dad55c176d366","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":true,"value":"1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-c72653d9ab0ee8be","role":"sequence","name":"Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-5"},"upper":{"closed":true,"value":"-1"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-5, -1]"}]},{"id":"e-3c4e27dedb9c54a8","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-500943bf802dcc95","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":"f3ecc14e84a19c598a911339469e2ba68b2103048575d8f0ed92c1d2f4509003","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":true,"value":"1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-392f49b496f79fbf","role":"sequence","name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","uses":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"-4"},"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0]"}]}],"used_by":[{"id":"e-a7cf73c813009d2a","operation":"basis_map","operation_detail":"A038207","conclusion_id":"n-c72653d9ab0ee8be","conclusion_name":"Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1."},{"id":"e-fcd19baf8f835cf0","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-392f49b496f79fbf","conclusion_name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals."}],"used_by_total":2,"links":[{"id":"l-80d3e90f67042191","kind":"oeis_match","node_a_id":"n-500943bf802dcc95","node_b_id":null,"fingerprint":null,"oeis_id":"A199324","in_catalog":0,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":0,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":70},"in_catalog":false,"oeis_id":"A199324","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A199324","relation":"match_triangle"}],"bfiles":[{"node_id":"n-500943bf802dcc95","oeis_id":"A199324","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":70,"oeis_terms_agreeing":70,"oeis_terms_available":70,"term_count":990,"raw_size":9280}],"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: -1,  1;\n   3:  0, -1,  1;\n   4:  1, -1, -1,   1;\n   5: -1,  3, -2,  -1,   1;\n   6:  0, -2,  5,  -3,  -1,  1;\n   7:  1, -2, -2,   7,  -4, -1,  1;\n   8: -1,  5, -7,  -1,   9, -5, -1,  1;\n   9:  0, -3, 12, -15,   1, 11, -6, -1,  1;\n  10:  1, -3, -3,  21, -26,  4, 13, -7, -1, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(1-x)*P(n-1,x) - (1-x)*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = -1 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := -1 + x;\nP[n_, x_] := P[n, x] = Expand[-(1 - x)*P[n - 1, x] - (1 - x)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = -1 + x; for(n = 3, N, my(i = n); v[i] = -(1 - x)*v[i - 1] - (1 - x)*v[i - 2]); 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}},{"oeis_id":"A199324","target":"triangle","first_row":1,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  1;\n  1: -1,  1;\n  2:  0, -1,  1;\n  3:  1, -1, -1,   1;\n  4: -1,  3, -2,  -1,   1;\n  5:  0, -2,  5,  -3,  -1,  1;\n  6:  1, -2, -2,   7,  -4, -1,  1;\n  7: -1,  5, -7,  -1,   9, -5, -1,  1;\n  8:  0, -3, 12, -15,   1, 11, -6, -1,  1;\n  9:  1, -3, -3,  21, -26,  4, 13, -7, -1, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(1-x)*P(n-1,x) - (1-x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := -1 + x;\nP[n_, x_] := P[n, x] = Expand[-(1 - x)*P[n - 1, x] - (1 - x)*P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = -1 + x; for(n = 2, N, my(i = n + 1); v[i] = -(1 - x)*v[i - 1] - (1 - x)*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":1,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-c72653d9ab0ee8be","steps":["x \u21a6 x\u22122"],"edges":["e-1365676e8cb0fd13"],"text":"A063967 \u2192 x \u21a6 x\u22122"},"headline":"A063967 \u2192 x \u21a6 x\u22122","chain":null}