{"id":"n-2165bfc6de63875a","revision":0,"first_index":0,"fingerprint":"f6-569cce7d14e40177","name":"shift_x_plus_one of veronese_section_2_1 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["2"],["2"],["12","8"],["60","48"],["360","344","32"],["2520","2760","480"],["20160","24576","5984","128"],["181440","241248","73472","3584"],["1814400","2593440","931104","71936","512"],["19958400","30339360","12385440","1301760","23040"],["239500800","384010560","174002112","22918784","686080","2048"],["3113510400","5231476800","2586399552","405867264","17402880","135168"],["43589145600","76352734080","40664984832","7349457792","411670016","5613568","8192"],["653837184000","1188865641600","675454590720","137260626048","9478816256","191027200","745472"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","2","2","20","108","736","5760","50848","499744","5411392","64008000","821120384","11354792064","168373614080","2665088631296"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","4"],["4","0"],["-1","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178216,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-c2fb9b523c7ccbe3"]},{"id":178217,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-a455fb9fdb671c61","e-c2fb9b523c7ccbe3"]},{"id":178218,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-a455fb9fdb671c61","e-c2fb9b523c7ccbe3"]},{"id":178219,"position":3,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-a455fb9fdb671c61"]},{"id":178220,"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-a455fb9fdb671c61"]}],"region_exact":{},"incoming_edges":[{"id":"e-a455fb9fdb671c61","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-2165bfc6de63875a","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":"6f3b69f2cc8172b943f0bd68f5d01a5486b7c7b9f36f8f8cb3043be61dc27947","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-cd0e6a1564dd27fb","role":"sequence","name":"veronese_section_2_1 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]},{"id":"e-c2fb9b523c7ccbe3","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-2165bfc6de63875a","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":"fdc6fd6295e386a98619f535c9185b27a190d7962cc79384ed13847f070eda7b","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-cd0e6a1564dd27fb","role":"sequence","name":"veronese_section_2_1 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, 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":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:       0;\n  1:       2;\n  2:       2;\n  3:      12,       8;\n  4:      60,      48;\n  5:     360,     344,     32;\n  6:    2520,    2760,    480;\n  7:   20160,   24576,   5984,   128;\n  8:  181440,  241248,  73472,  3584;\n  9: 1814400, 2593440, 931104, 71936, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-4*n-4*x)*P(n-2,x) + (2*n-3)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 4*n - 4*x)*P[n - 2, x] + (2*n - 3)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 4*n - 4*x)*v[i - 2] + (2*n - 3)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-60c7e36cbe887b7e","steps":["Veronese 2 (j=1)","basis A007318"],"edges":["e-28dcf565f3f6cf28","e-a455fb9fdb671c61"],"text":"A137320 \u2192 Veronese 2 (j=1) \u2192 basis A007318"},"headline":"A137320 \u2192 Veronese 2 (j=1) \u2192 basis A007318","chain":null}