{"id":"n-21c6f4e12b73105f","revision":1,"first_index":0,"fingerprint":"f6-d97a4e18e77d1297","name":"veronese_section_2_0 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":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1"],["1"],["1","9"],["1","27"],["1","54"],["1","90"],["1","135","81"],["1","189","405"],["1","252","1215"],["1","324","2835"],["1","405","5670","729"],["1","495","10206","5103"],["1","594","17010","20412"]],"degrees":[0,0,0,0,1,1,1,1,2,2,2,2,3,3,3],"row_sums":["1","1","1","1","10","28","55","91","217","595","1468","3160","6805","15805","38017"],"nonn":true,"definitions":[{"position":0,"source":"derived:veronese_section_2_0","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"],["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","9"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163186,"position":0,"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-1c5b9a0a4dd25652"]},{"id":163187,"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-1c5b9a0a4dd25652"]},{"id":163188,"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-1c5b9a0a4dd25652"]},{"id":163189,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-1c5b9a0a4dd25652"]}],"region_exact":{},"incoming_edges":[{"id":"e-1c5b9a0a4dd25652","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":0},"operation_detail":"r=2, j=0, shift 0","conclusion_id":"n-21c6f4e12b73105f","premise_count":1,"theorem":"Veronese sections of Polya frequency sequences (Aissen--Schoenberg--Whitney--Edrei): if P is real-rooted with coefficients of one sign, equivalently nonzero with all roots in (-inf, 0], every section V_(r,j)(P) is zero or real-rooted with roots in (-inf, 0]","lean_route":null,"lean_declarations":[],"certificate_hash":"75d31877a0ef3fd208452440b427b15539b6697b036fcf9f64978611286c1ff2","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":"previous_interlaces_next"}],"premises":[{"position":0,"node_id":"n-e189038e95d51606","role":"sequence","name":"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: 1;\n  3: 1;\n  4: 1,   9;\n  5: 1,  27;\n  6: 1,  54;\n  7: 1,  90;\n  8: 1, 135,  81;\n  9: 1, 189, 405;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*P(n-1,x) - P(n-2,x) + 9*x*P(n-4,x) for n >= 4, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 1, P(3,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 1;\nP[3, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - P[n - 2, x] + 9*x*P[n - 4, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; v[3] = 1; v[4] = 1; for(n = 4, N, my(i = n + 1); v[i] = 2*v[i - 1] - v[i - 2] + 9*x*v[i - 4]); 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":["Veronese 2"],"edges":["e-1c5b9a0a4dd25652"],"text":"A304236 \u2192 Veronese 2"},"headline":"A304236 \u2192 Veronese 2","chain":null}