{"id":"n-ad5b940449290f60","revision":0,"first_index":0,"fingerprint":"f6-74ce1bee19a36935","name":"theta_plus_one_squared 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","12"],["96","96"],["240","480","27"],["576","1920","324"],["1344","6720","2268","48"],["3072","21504","12096","768"],["6912","64512","54432","6912","75"],["15360","184320","217728","46080","1500"],["33792","506880","798336","253440","16500","108"],["73728","1351680","2737152","1216512","132000","2592"],["159744","3514368","8895744","5271552","858000","33696","147"],["344064","8945664","27675648","21086208","4804800","314496","4116"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","3","12","48","192","747","2820","10380","37440","132843","464988","1609056","5513664","18733251","63174996"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["3"]],"recurrence":{"denominator":{"coeffs":[["-128","32","0"],["128","-176","0"],["0","224","-2"],["0","-80","6"],["0","0","-6"],["0","0","2"]]},"terms":[{"coeff":{"coeffs":[["0","-512","-64","0"],["256","192","48","0"],["0","288","136","-2"],["0","-160","-68","-3"],["0","0","-8","0"],["0","0","4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","512","0","-32","0"],["0","0","-64","16","0"],["0","0","-320","88","-2"],["0","0","0","16","-4"],["0","0","0","8","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174847,"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-3c9c9a4462f98fe4"]},{"id":174848,"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-3c9c9a4462f98fe4"]},{"id":174849,"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-3c9c9a4462f98fe4"]}],"region_exact":{},"incoming_edges":[{"id":"e-3c9c9a4462f98fe4","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-ad5b940449290f60","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":"9761315729dae822de7ea6a6173e1ee4a8f7a874ceb2446b434443754fecc9ac","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-c26d32b48a425eb0","kind":"fingerprint_related","node_a_id":"n-7b5f371f6c6f4176","node_b_id":"n-ad5b940449290f60","fingerprint":"f6-74ce1bee19a36935","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-74ce1bee19a36935"},"other_id":"n-7b5f371f6c6f4176","other":{"id":"n-7b5f371f6c6f4176","name":"theta_plus_one_squared of veronese_section_2_1 of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-74ce1bee19a36935","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","4"],["32","32"]],"row_sums_preview":["0","1","4","16","64","249","940","3460"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-af754f07daf65b5e","steps":["Veronese 2 (j=1)","(\u03b8+1)\u00b2"],"edges":["e-868a2ac5701aa5c6","e-b8cadfab9a49c26e"],"text":"A038207 \u2192 Veronese 2 (j=1) \u2192 (\u03b8+1)\u00b2"},"headline":"A038207 \u2192 Veronese 2 (j=1) \u2192 (\u03b8+1)\u00b2","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,    12;\n  4:   96,    96;\n  5:  240,   480,    27;\n  6:  576,  1920,   324;\n  7: 1344,  6720,  2268,   48;\n  8: 3072, 21504, 12096,  768;\n  9: 6912, 64512, 54432, 6912, 75;\n","recurrence_sentence":"The row polynomials satisfy (128*n-128-(80*n^3-224*n^2+176*n-32)*x+(2*n^5-6*n^4+6*n^3-2*n^2)*x^2)*P(n,x) = (256*n-(160*n^3-288*n^2-192*n+512)*x+(4*n^5-8*n^4-68*n^3+136*n^2+48*n-64)*x^2+(n^5-3*n^3-2*n^2)*x^3)*P(n-1,x) + (512*x-(320*n^2+64*n)*x^2+(8*n^4+16*n^3+88*n^2+16*n-32)*x^3-(2*n^4+4*n^3+2*n^2)*x^4)*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[((256*n - (160*n^3 - 288*n^2 - 192*n + 512)*x + (4*n^5 - 8*n^4 - 68*n^3 + 136*n^2 + 48*n - 64)*x^2 + (n^5 - 3*n^3 - 2*n^2)*x^3)*P[n - 1, x] + (512*x - (320*n^2 + 64*n)*x^2 + (8*n^4 + 16*n^3 + 88*n^2 + 16*n - 32)*x^3 - (2*n^4 + 4*n^3 + 2*n^2)*x^4)*D[P[n - 1, x], x])/(128*n - 128 - (80*n^3 - 224*n^2 + 176*n - 32)*x + (2*n^5 - 6*n^4 + 6*n^3 - 2*n^2)*x^2)]];\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] = ((256*n - (160*n^3 - 288*n^2 - 192*n + 512)*x + (4*n^5 - 8*n^4 - 68*n^3 + 136*n^2 + 48*n - 64)*x^2 + (n^5 - 3*n^3 - 2*n^2)*x^3)*v[i - 1] + (512*x - (320*n^2 + 64*n)*x^2 + (8*n^4 + 16*n^3 + 88*n^2 + 16*n - 32)*x^3 - (2*n^4 + 4*n^3 + 2*n^2)*x^4)*deriv(v[i - 1], x))/(128*n - 128 - (80*n^3 - 224*n^2 + 176*n - 32)*x + (2*n^5 - 6*n^4 + 6*n^3 - 2*n^2)*x^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-51b4f5e7901c2b50","steps":["Veronese 2 (j=1)","(\u03b8+1)\u00b2"],"edges":["e-7d561377a0a291f9","e-3c9c9a4462f98fe4"],"text":"A120910 \u2192 Veronese 2 (j=1) \u2192 (\u03b8+1)\u00b2"},"headline":"A120910 \u2192 Veronese 2 (j=1) \u2192 (\u03b8+1)\u00b2","chain":null}