{"id":"n-feaf9dc130ceb19e","revision":1,"first_index":0,"fingerprint":"f5-56a1115ccd1ac961","name":"veronese_section_2_1 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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"],["2"],["3"],["4"],["5","1"],["6","4"],["7","10"],["8","20"],["9","35","1"],["10","56","6"],["11","84","21"],["12","120","56"],["13","165","126","1"]],"degrees":[-1,-1,0,0,0,0,1,1,1,1,2,2,2,2,3],"row_sums":["0","0","1","2","3","4","6","10","17","28","45","72","116","188","305"],"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"],["0"],["1"],["2"]],"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","1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":162984,"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-d4f58d8e823ba8d6"]},{"id":162985,"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-d4f58d8e823ba8d6"]},{"id":162986,"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-d4f58d8e823ba8d6"]},{"id":162987,"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-d4f58d8e823ba8d6"]}],"region_exact":{},"incoming_edges":[{"id":"e-d4f58d8e823ba8d6","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":1},"operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-feaf9dc130ceb19e","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":"55c43076ea006f436d303123f7eb60b17b1397dfa913a0ede6c8e54c676bcc12","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-75ccd0453a9b6cec","role":"sequence","name":"Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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":[{"id":"l-2d41e018bdeade15","kind":"fingerprint_related","node_a_id":"n-feaf9dc130ceb19e","node_b_id":"n-b48eb0f89a896eaf","fingerprint":"f5-56a1115ccd1ac961","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f5-56a1115ccd1ac961"},"other_id":"n-b48eb0f89a896eaf","other":{"id":"n-b48eb0f89a896eaf","name":"veronese_section_2_1 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","first_index":1,"fingerprint":"f5-56a1115ccd1ac961","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],[],["1"]],"card_rows":[["1"],["2"],["3"],["4"]],"row_sums_preview":["0","0","1","2","3","4","6","10"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8b3f39d03de798f","steps":["Veronese 2 (j=1)"],"edges":["e-0a03744cfe1218ee"],"text":"A052553 \u2192 Veronese 2 (j=1)"},"headline":"A052553 \u2192 Veronese 2 (j=1)","chain":null}},{"id":"l-13b302d94e9f2a69","kind":"oeis_match","node_a_id":"n-feaf9dc130ceb19e","node_b_id":null,"fingerprint":null,"oeis_id":"A024490","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":2,"oeis_term_position":0,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A024490","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A024490","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-feaf9dc130ceb19e","oeis_id":"A024490","target":"row_sums","oeis_offset":2,"first_row":2,"rows_used":200,"terms_matched":13,"oeis_terms_agreeing":39,"oeis_terms_available":39,"term_count":200,"raw_size":5149}],"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: 0;\n  2: 1;\n  3: 2;\n  4: 3;\n  5: 4;\n  6: 5,  1;\n  7: 6,  4;\n  8: 7, 10;\n  9: 8, 20;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*P(n-1,x) - P(n-2,x) + x*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1, P(3,x) = 2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 1;\nP[3, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[2*P[n - 1, x] - P[n - 2, x] + 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] = 0; v[2] = 0; v[3] = 1; v[4] = 2; for(n = 4, N, my(i = n + 1); v[i] = 2*v[i - 1] - v[i - 2] + 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-75ccd0453a9b6cec","steps":["Veronese 2 (j=1)"],"edges":["e-d4f58d8e823ba8d6"],"text":"A011973 \u2192 Veronese 2 (j=1)"},"headline":"A011973 \u2192 Veronese 2 (j=1)","chain":null}