{"id":"n-e854ea78c8ed5135","revision":1,"first_index":0,"fingerprint":"f6-e3cb0c43805a5d46","name":"veronese_section_2_1 of Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = k <= n-1, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for even n and 1 <= k <= n-1.","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":[[],["1"],["3"],["4","1"],["6","6"],["7","17","1"],["9","45","9"],["10","75","39","1"],["12","144","144","12"],["13","202","339","70","1"],["15","330","873","330","15"],["16","425","1558","1015","110","1"],["18","630","3258","3258","630","18"],["19","771","5028","7247","2400","159","1"],["21","1071","9198","18483","9198","1071","21"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","1","3","5","12","25","63","125","312","625","1563","3125","7812","15625","39063"],"nonn":true,"definitions":[{"position":0,"source":"derived:veronese_section_2_1","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["1"],["3"],["4","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","7","-1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163107,"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-653b1ce2575428c8"]},{"id":163108,"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-653b1ce2575428c8"]},{"id":163109,"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-653b1ce2575428c8"]}],"region_exact":{},"incoming_edges":[{"id":"e-653b1ce2575428c8","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":1},"operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-e854ea78c8ed5135","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":"5f1fc32201229ab3c29bdae58e228361ee16b53e5f53ae4ebc0013d6b80c2385","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-4e0b19699f4cf0db","role":"sequence","name":"Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = k <= n-1, T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-2,k-1) for even n and 1 <= k <= n-1.","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:  1;\n  2:  3;\n  3:  4,   1;\n  4:  6,   6;\n  5:  7,  17,   1;\n  6:  9,  45,   9;\n  7: 10,  75,  39,  1;\n  8: 12, 144, 144, 12;\n  9: 13, 202, 339, 70, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-2,x) - (1-7*x+x^2)*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 3, P(3,x) = 4 + x.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[2, x_] := 3;\nP[3, x_] := 4 + x;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 2, x] - (1 - 7*x + x^2)*P[n - 4, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; v[3] = 3; v[4] = 4 + x; for(n = 4, N, my(i = n + 1); v[i] = (2 + 2*x)*v[i - 2] - (1 - 7*x + x^2)*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-4e0b19699f4cf0db","steps":["Veronese 2 (j=1)"],"edges":["e-653b1ce2575428c8"],"text":"A026374 \u2192 Veronese 2 (j=1)"},"headline":"A026374 \u2192 Veronese 2 (j=1)","chain":null}