{"id":"n-4122805085b66d03","revision":0,"first_index":0,"fingerprint":"f6-34f0c3974a863c91","name":"theta_plus_one_squared of veronese_section_2_1 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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"],["3"],["11","4"],["50","40"],["274","340","9"],["1764","2940","189"],["13068","27076","2898","16"],["109584","269136","40824","576"],["1026576","2894720","569457","13920","25"],["10628640","33638000","8118495","290400","1375"],["120543840","421032304","120055815","5718768","48125","36"],["1486442880","5656059552","1854631350","110826144","1394250","2808"],["19802759040","81255012384","30025069074","2160583568","36861825","134316","49"],["283465647360","1243957041600","509970300840","42903260400","932806875","5159700","5145"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","1","3","15","90","623","4893","43058","420120","4504698","52676910","667398888","9109356984","133280420256","2081234221920"],"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"],["1"],["3"],["11","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-81","36","9"],["108","-24","0"],["-54","4","0"],["12","0","0"],["-1","0","0"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","0","-36","4"],["0","0","24","0"],["0","0","-4","0"]]},"deriv_order":1,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-65","20"],["76","-8"],["-30","0"],["4","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","0","-20"],["0","0","8"]]},"deriv_order":1,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-25","4"],["24","0"],["-6","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-6"],["4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178272,"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-a0596b273a8dc87c"]},{"id":178273,"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-a0596b273a8dc87c"]},{"id":178274,"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-a0596b273a8dc87c"]}],"region_exact":{},"incoming_edges":[{"id":"e-a0596b273a8dc87c","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-4122805085b66d03","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":"8a5a2aecbe7b2ed3bfdbe78f324aa29728e710a475305095527209036f5e917d","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-ead5149323bf4a66","role":"sequence","name":"veronese_section_2_1 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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":[],"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:       1;\n  2:       3;\n  3:      11,       4;\n  4:      50,      40;\n  5:     274,     340,      9;\n  6:    1764,    2940,    189;\n  7:   13068,   27076,   2898,    16;\n  8:  109584,  269136,  40824,   576;\n  9: 1026576, 2894720, 569457, 13920, 25;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^4-12*n^3+54*n^2-108*n+81-(4*n^2-24*n+36)*x-9*x^2)*P(n-4,x) - ((4*n^2-24*n+36)*x^2-4*x^3)*d/dx P(n-4,x) + (4*n^3-30*n^2+76*n-65-(8*n-20)*x)*P(n-3,x) + (8*n-20)*x^2*d/dx P(n-3,x) - (6*n^2-24*n+25-4*x)*P(n-2,x) - 4*x^2*d/dx P(n-2,x) + (4*n-6)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 3, P(3,x) = 11 + 4*x.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[2, x_] := 3;\nP[3, x_] := 11 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 - (4*n^2 - 24*n + 36)*x - 9*x^2)*P[n - 4, x] - ((4*n^2 - 24*n + 36)*x^2 - 4*x^3)*D[P[n - 4, x], x] + (4*n^3 - 30*n^2 + 76*n - 65 - (8*n - 20)*x)*P[n - 3, x] + (8*n - 20)*x^2*D[P[n - 3, x], x] - (6*n^2 - 24*n + 25 - 4*x)*P[n - 2, x] - 4*x^2*D[P[n - 2, x], x] + (4*n - 6)*P[n - 1, 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] = 3; v[4] = 11 + 4*x; for(n = 4, N, my(i = n + 1); v[i] = -(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 - (4*n^2 - 24*n + 36)*x - 9*x^2)*v[i - 4] - ((4*n^2 - 24*n + 36)*x^2 - 4*x^3)*deriv(v[i - 4], x) + (4*n^3 - 30*n^2 + 76*n - 65 - (8*n - 20)*x)*v[i - 3] + (8*n - 20)*x^2*deriv(v[i - 3], x) - (6*n^2 - 24*n + 25 - 4*x)*v[i - 2] - 4*x^2*deriv(v[i - 2], x) + (4*n - 6)*v[i - 1]); 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-efe23a76953cf69d","steps":["Veronese 2 (j=1)","(\u03b8+1)\u00b2"],"edges":["e-59d75b370e10c587","e-a0596b273a8dc87c"],"text":"A130534 \u2192 Veronese 2 (j=1) \u2192 (\u03b8+1)\u00b2"},"headline":"A130534 \u2192 Veronese 2 (j=1) \u2192 (\u03b8+1)\u00b2","chain":null}