{"id":"n-5850d1b617b606a6","revision":0,"first_index":1,"fingerprint":"f6-af694739d2ce3984","name":"shift_x_plus_one of basis_map_A008277 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":1,"rr_by_factors":false,"rows":[["1"],["2","1"],["7","6","1"],["25","32","11","1"],["102","170","89","17","1"],["456","933","656","194","24","1"],["2219","5357","4716","1900","366","32","1"],["11640","32289","34060","17402","4599","627","41","1"],["65364","204349","250656","155146","52387","9830","1002","51","1"],["390646","1356350","1893146","1375400","566749","136443","19165","1519","62","1"],["2472719","9425711","14727545","12273076","5976727","1764049","318599","34801","2209","74","1"],["16508791","68450930","118210253","111036975","62411792","21873504","4856844","682812","59705","3106","87","1"],["115839661","518487029","979557986","1023042129","651828930","264904048","70064388","12129272","1365373","97774","4247","101","1"],["851634863","4088698807","8380248227","9625126647","6853411196","3171210978","975831996","201630612","27970784","2578098","154010","5672","116","1"],["6542134884","33508644458","73990917016","92621610597","72860184662","37833423612","13299605286","3204424596","531204302","60353319","4638459","234710","7424","132","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","14","69","379","2264","14591","100659","738786","5739481","46995511","404094800","3637320939","34178502007","334457383458"],"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"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176251,"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-8d238aa51b1bdae9"]},{"id":176252,"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-8d238aa51b1bdae9"]},{"id":176253,"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-8d238aa51b1bdae9"]}],"region_exact":{},"incoming_edges":[{"id":"e-8d238aa51b1bdae9","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-5850d1b617b606a6","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":"74b3abe3ed2525a84064e9c08e37f9b98734bcc3a54aff1bc482803aa4d30ee9","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-45d3b6c39c71e61d","role":"sequence","name":"basis_map_A008277 of 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":{"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:      2,       1;\n   3:      7,       6,       1;\n   4:     25,      32,      11,       1;\n   5:    102,     170,      89,      17,      1;\n   6:    456,     933,     656,     194,     24,      1;\n   7:   2219,    5357,    4716,    1900,    366,     32,     1;\n   8:  11640,   32289,   34060,   17402,   4599,    627,    41,    1;\n   9:  65364,  204349,  250656,  155146,  52387,   9830,  1002,   51,  1;\n  10: 390646, 1356350, 1893146, 1375400, 566749, 136443, 19165, 1519, 62, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+x)*P(n-2,x) + (1+x)*d/dx P(n-2,x) + (2+x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 2, x] + (1 + x)*D[P[n - 2, x], x] + (2 + x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + x; for(n = 3, N, my(i = n); v[i] = (2 + x)*v[i - 2] + (1 + x)*deriv(v[i - 2], x) + (2 + x)*v[i - 1] + (1 + x)*deriv(v[i - 1], x)); 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-392f49b496f79fbf","steps":["basis A008277","x \u21a6 x+1"],"edges":["e-08527b1121a7be71","e-8d238aa51b1bdae9"],"text":"A026729 \u2192 basis A008277 \u2192 x \u21a6 x+1"},"headline":"A026729 \u2192 basis A008277 \u2192 x \u21a6 x+1","chain":null}