{"id":"n-cd0e6a1564dd27fb","revision":1,"first_index":0,"fingerprint":"f6-0ebda4c6e1c73679","name":"veronese_section_2_1 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.","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":[[],["2"],["2"],["4","8"],["12","48"],["48","280","32"],["240","1800","480"],["1440","12992","5600","128"],["10080","105056","62720","3584"],["80640","944992","718368","69888","512"],["725760","9381600","8618400","1209600","23040"],["7257600","102028608","109341760","20194944","675840","2048"],["79833600","1207343808","1471863360","337607424","16727040","135168"],["958003200","15452476416","21030618752","5758749568","383725056","5564416","8192"],["12454041600","212773736448","318646520192","101240723584","8534862336","186554368","745472"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","2","2","12","60","360","2520","20160","181440","1814400","19958400","239500800","3113510400","43589145600","653837184000"],"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"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-3","0"],["2","0"],["0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4","4"],["4","0"],["-1","0"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":168644,"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-c1188bdfcb979c8e"]},{"id":168645,"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-c1188bdfcb979c8e"]},{"id":168646,"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-c1188bdfcb979c8e"]}],"region_exact":{},"incoming_edges":[{"id":"e-c1188bdfcb979c8e","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":1},"operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-cd0e6a1564dd27fb","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":"3497ad1753bc77d8814d525e15abe381ea9cf07cf15abdefd4c09dbb8e1b8857","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-60c7e36cbe887b7e","role":"sequence","name":"Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.","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-4a9c59f981f72902","kind":"oeis_match","node_a_id":"n-cd0e6a1564dd27fb","node_b_id":null,"fingerprint":null,"oeis_id":"A357711","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":3,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":3,"target":"row_sums","terms_compared":12},"in_catalog":false,"oeis_id":"A357711","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-7e60cb38a2726ffc","kind":"oeis_match","node_a_id":"n-cd0e6a1564dd27fb","node_b_id":null,"fingerprint":null,"oeis_id":"A188588","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":3,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":3,"target":"row_sums","terms_compared":12},"in_catalog":false,"oeis_id":"A188588","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A188588","relation":"match_row_sums"},{"oeis_id":"A357711","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:     2;\n  2:     2;\n  3:     4,      8;\n  4:    12,     48;\n  5:    48,    280,     32;\n  6:   240,   1800,    480;\n  7:  1440,  12992,   5600,   128;\n  8: 10080, 105056,  62720,  3584;\n  9: 80640, 944992, 718368, 69888, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-3)*P(n-1,x) - (n^2-4*n+4-4*x)*P(n-2,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[(2*n - 3)*P[n - 1, x] - (n^2 - 4*n + 4 - 4*x)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 3)*v[i - 1] - (n^2 - 4*n + 4 - 4*x)*v[i - 2]); 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-60c7e36cbe887b7e","steps":["Veronese 2 (j=1)"],"edges":["e-c1188bdfcb979c8e"],"text":"A137320 \u2192 Veronese 2 (j=1)"},"headline":"A137320 \u2192 Veronese 2 (j=1)","chain":null}