{"id":"n-f050517ea751864e","revision":0,"first_index":0,"fingerprint":"f6-b5cdec76cd14acc3","name":"shift_x_plus_one of basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["10","6"],["19","12"],["109","126","36"],["280","348","108"],["1261","2136","1188","216"],["3781","6948","4248","864"],["15130","33738","27756","9936","1296"],["49159","118956","107676","43200","6480"],["185329","513378","559908","299160","77760","7776"],["627760","1878936","2242728","1334016","395280","46656"],["2295721","7611312","10362168","7385904","2890080","583200","46656"],["7945561","28288296","41820336","32848416","14451696","3374784","326592"],["28607050","110564430","180747720","161494560","84777840","25964064","4245696","279936"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","16","31","271","736","4801","15841","87856","325471","1643311","6525376","31175041","129055681","596681296"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["2"]]},"terms":[{"coeff":{"coeffs":[["-36","-24"],["38","24"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-111","-146","-48"]]},"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-a0db61b1ca32d092","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["9","6"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174956,"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-7b121d5f5ef488d5"]},{"id":174957,"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-2659fb535a51b641","e-7b121d5f5ef488d5"]},{"id":174958,"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-2659fb535a51b641","e-7b121d5f5ef488d5"]},{"id":174959,"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-2659fb535a51b641"]},{"id":174960,"position":4,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-2659fb535a51b641"]}],"region_exact":{},"incoming_edges":[{"id":"e-2659fb535a51b641","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-f050517ea751864e","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":"19a200f12d7a2677820dd57f45c10d1b9d01a760a0ac855d3102bc959cac0d67","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-f074ae9ffad82cf4","role":"sequence","name":"basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.","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-a0db61b1ca32d092","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-f050517ea751864e","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":"fc40f9e245e3e5ee4276f066033427bea03829719bf134dff2979abfbe36f3ea","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-7b121d5f5ef488d5","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-f050517ea751864e","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":"fe70908d3a52203d1e8b32bb222639499620ada3d091cf03ec32d426e0060212","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-f074ae9ffad82cf4","role":"sequence","name":"basis_map_A013609 of Triangle T(n,k) = T(n-1,k) + 3*T(n-2,k-1) for k = 0..floor(n/2), with T(0,0) = 1, T(n,k) = 0 for n or k < 0, read by rows.","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:     1;\n  1:     1;\n  2:    10,      6;\n  3:    19,     12;\n  4:   109,    126,     36;\n  5:   280,    348,    108;\n  6:  1261,   2136,   1188,   216;\n  7:  3781,   6948,   4248,   864;\n  8: 15130,  33738,  27756,  9936, 1296;\n  9: 49159, 118956, 107676, 43200, 6480;\n","recurrence_sentence":"The row polynomials satisfy 2*n*P(n,x) = (38*n-36+(24*n-24)*x)*P(n-1,x) - (111+146*x+48*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((38*n - 36 + (24*n - 24)*x)*P[n - 1, x] - (111 + 146*x + 48*x^2)*D[P[n - 1, x], x])/(2*n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((38*n - 36 + (24*n - 24)*x)*v[i - 1] - (111 + 146*x + 48*x^2)*deriv(v[i - 1], x))/(2*n)); 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-e189038e95d51606","steps":["basis A013609","basis A007318"],"edges":["e-79f6722e524950c5","e-2659fb535a51b641"],"text":"A304236 \u2192 basis A013609 \u2192 basis A007318"},"headline":"A304236 \u2192 basis A013609 \u2192 basis A007318","chain":null}