{"id":"n-a130f903e4be4883","revision":0,"first_index":0,"fingerprint":"f6-1df687e36f82ea7b","name":"theta_plus_one of veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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":[[],["3"],["12"],["36","6"],["96","48"],["240","240","9"],["576","960","108"],["1344","3360","756","12"],["3072","10752","4032","192"],["6912","32256","18144","1728","15"],["15360","92160","72576","11520","300"],["33792","253440","266112","63360","3300","18"],["73728","675840","912384","304128","26400","432"],["159744","1757184","2965248","1317888","171600","5616","21"],["344064","4472832","9225216","5271552","960960","52416","588"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","3","12","42","144","489","1644","5472","18048","59055","191916","620022","1992912","6377301","20327628"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["3"]],"recurrence":{"denominator":{"coeffs":[["16","0"],["-16","2"],["0","-4"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["0","32","0"],["-32","-16","-2"],["0","-4","-1"],["0","4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-64","16","0"],["0","0","8","-2"],["0","0","8","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174844,"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-138d4670eb23b321"]},{"id":174845,"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-138d4670eb23b321"]},{"id":174846,"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-138d4670eb23b321"]}],"region_exact":{},"incoming_edges":[{"id":"e-138d4670eb23b321","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-a130f903e4be4883","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"5a2be72b901b4c62ecb15a7cef6ab400ce1fd7464cd63c28e778546493c82e06","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-a1bd1d1e7fcaa1ad","role":"sequence","name":"veronese_section_2_1 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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-0ed215fb76dfddb0","kind":"fingerprint_related","node_a_id":"n-ac0ad3fe91bd1135","node_b_id":"n-a130f903e4be4883","fingerprint":"f6-1df687e36f82ea7b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1df687e36f82ea7b"},"other_id":"n-ac0ad3fe91bd1135","other":{"id":"n-ac0ad3fe91bd1135","name":"theta_plus_one of veronese_section_2_1 of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-1df687e36f82ea7b","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["4"]],"card_rows":[["1"],["4"],["12","2"],["32","16"]],"row_sums_preview":["0","1","4","14","48","163","548","1824"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-af754f07daf65b5e","steps":["Veronese 2 (j=1)","\u03b8+1"],"edges":["e-868a2ac5701aa5c6","e-264e227824636215"],"text":"A038207 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1"},"headline":"A038207 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1","chain":null}}],"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:    3;\n  2:   12;\n  3:   36,     6;\n  4:   96,    48;\n  5:  240,   240,     9;\n  6:  576,   960,   108;\n  7: 1344,  3360,   756,   12;\n  8: 3072, 10752,  4032,  192;\n  9: 6912, 32256, 18144, 1728, 15;\n","recurrence_sentence":"The row polynomials satisfy -(16*n-16-(2*n^3-4*n^2+2*n)*x)*P(n,x) = -(32*n-(4*n^3-4*n^2-16*n+32)*x-(n^3-n^2-2*n)*x^2)*P(n-1,x) - (64*x-(8*n^2+8*n+16)*x^2+(2*n^2+2*n)*x^3)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 3.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[Together[(-(32*n - (4*n^3 - 4*n^2 - 16*n + 32)*x - (n^3 - n^2 - 2*n)*x^2)*P[n - 1, x] - (64*x - (8*n^2 + 8*n + 16)*x^2 + (2*n^2 + 2*n)*x^3)*D[P[n - 1, x], x])/(-16*n + 16 + (2*n^3 - 4*n^2 + 2*n)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 3; for(n = 2, N, my(i = n + 1); v[i] = (-(32*n - (4*n^3 - 4*n^2 - 16*n + 32)*x - (n^3 - n^2 - 2*n)*x^2)*v[i - 1] - (64*x - (8*n^2 + 8*n + 16)*x^2 + (2*n^2 + 2*n)*x^3)*deriv(v[i - 1], x))/(-16*n + 16 + (2*n^3 - 4*n^2 + 2*n)*x)); 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-51b4f5e7901c2b50","steps":["Veronese 2 (j=1)","\u03b8+1"],"edges":["e-7d561377a0a291f9","e-138d4670eb23b321"],"text":"A120910 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1"},"headline":"A120910 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1","chain":null}