{"id":"n-88efd413b1f67765","revision":1,"first_index":0,"fingerprint":"f6-aabd64037c7625c9","name":"veronese_section_2_1 of Triangle read by rows: T(n,k) = binomial(k,n-k).","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"],["2"],["1","1"],["0","4"],["0","6","1"],["0","4","6"],["0","1","15","1"],["0","0","20","8"],["0","0","15","28","1"],["0","0","6","56","10"],["0","0","1","70","45","1"],["0","0","0","56","120","12"],["0","0","0","28","210","66","1"],["0","0","0","8","252","220","14"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","1","2","2","4","7","10","17","28","44","72","117","188","305","494"],"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"],["2"],["1","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":4,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":162999,"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-5fd69073a0dc342e"]},{"id":163000,"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-5fd69073a0dc342e"]},{"id":163001,"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-5fd69073a0dc342e"]}],"region_exact":{},"incoming_edges":[{"id":"e-5fd69073a0dc342e","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":1},"operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-88efd413b1f67765","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":"19efa6c4f458480449894a1544b5af91db93b1b08920e80bc016cf082f53b1cf","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-21854f4257effb01","role":"sequence","name":"Triangle read by rows: T(n,k) = binomial(k,n-k).","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-893d770798c55a74","kind":"fingerprint_related","node_a_id":"n-5f5af7eecc96c11b","node_b_id":"n-88efd413b1f67765","fingerprint":"f6-aabd64037c7625c9","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-aabd64037c7625c9"},"other_id":"n-5f5af7eecc96c11b","other":{"id":"n-5f5af7eecc96c11b","name":"veronese_section_2_0 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","first_index":1,"fingerprint":"f6-aabd64037c7625c9","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],[],["0","1"]],"card_rows":[["1"],["0","1"],["0","2"],["0","1","1"]],"row_sums_preview":["1","0","1","2","2","4","7","10"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-392f49b496f79fbf","steps":["Veronese 2"],"edges":["e-5f839b5d51ad7f7c"],"text":"A026729 \u2192 Veronese 2"},"headline":"A026729 \u2192 Veronese 2","chain":null}},{"id":"l-5c74dc1701050cd6","kind":"oeis_match","node_a_id":"n-88efd413b1f67765","node_b_id":null,"fingerprint":null,"oeis_id":"A094686","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A094686","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A094686","relation":"match_row_sums"}],"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: 2;\n  3: 1, 1;\n  4: 0, 4;\n  5: 0, 6,  1;\n  6: 0, 4,  6;\n  7: 0, 1, 15,  1;\n  8: 0, 0, 20,  8;\n  9: 0, 0, 15, 28, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = x*P(n-2,x) + 2*x*P(n-3,x) + x*P(n-4,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 2, P(3,x) = 1 + x.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[2, x_] := 2;\nP[3, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[x*P[n - 2, x] + 2*x*P[n - 3, 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] = 1; v[3] = 2; v[4] = 1 + x; for(n = 4, N, my(i = n + 1); v[i] = x*v[i - 2] + 2*x*v[i - 3] + 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-21854f4257effb01","steps":["Veronese 2 (j=1)"],"edges":["e-5fd69073a0dc342e"],"text":"A030528 \u2192 Veronese 2 (j=1)"},"headline":"A030528 \u2192 Veronese 2 (j=1)","chain":null}