{"id":"n-6ff0a0610be48ccf","revision":0,"first_index":0,"fingerprint":"f6-1da553def909efa3","name":"theta_plus_one 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","2"],["50","20"],["274","170","3"],["1764","1470","63"],["13068","13538","966","4"],["109584","134568","13608","144"],["1026576","1447360","189819","3480","5"],["10628640","16819000","2706165","72600","275"],["120543840","210516152","40018605","1429692","9625","6"],["1486442880","2828029776","618210450","27706536","278850","468"],["19802759040","40627506192","10008356358","540145892","7372365","22386","7"],["283465647360","621978520800","169990100280","10725815100","186561375","859950","735"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","1","3","13","70","447","3297","27576","257904","2667240","30226680","372517920","4960668960","70986162240","1086347505600"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["1"],["3"],["11","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-81","18","-1"],["108","-12","0"],["-54","2","0"],["12","0","0"],["-1","0","0"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-65","10"],["76","-4"],["-30","0"],["4","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-25","2"],["24","0"],["-6","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-6"],["4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178269,"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-88634d2801bbb8bf"]},{"id":178270,"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-88634d2801bbb8bf"]},{"id":178271,"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-88634d2801bbb8bf"]}],"region_exact":{},"incoming_edges":[{"id":"e-88634d2801bbb8bf","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-6ff0a0610be48ccf","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":"7309020fbe24e4c6ec41479edd8971656f1cbf2741e1ea4d755a783dd29529d5","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":[{"id":"l-173e12ee1f81e88a","kind":"fingerprint_related","node_a_id":"n-c7c8ab60914614f1","node_b_id":"n-6ff0a0610be48ccf","fingerprint":"f6-1da553def909efa3","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1da553def909efa3"},"other_id":"n-c7c8ab60914614f1","other":{"id":"n-c7c8ab60914614f1","name":"derivative of veronese_section_2_0 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.","first_index":0,"fingerprint":"f6-1da553def909efa3","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],[],["1"]],"card_rows":[["1"],["3"],["11","2"],["50","20"]],"row_sums_preview":["0","0","1","3","13","70","447","3297"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["Veronese 2","D"],"edges":["e-37358459ee0a1b93","e-5623cdb25dbb5ba0"],"text":"A132393 \u2192 Veronese 2 \u2192 D"},"headline":"A132393 \u2192 Veronese 2 \u2192 D","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:       1;\n  2:       3;\n  3:      11,       2;\n  4:      50,      20;\n  5:     274,     170,      3;\n  6:    1764,    1470,     63;\n  7:   13068,   13538,    966,    4;\n  8:  109584,  134568,  13608,  144;\n  9: 1026576, 1447360, 189819, 3480, 5;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^4-12*n^3+54*n^2-108*n+81-(2*n^2-12*n+18)*x+x^2)*P(n-4,x) + (4*n^3-30*n^2+76*n-65-(4*n-10)*x)*P(n-3,x) - (6*n^2-24*n+25-2*x)*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 + 2*x.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[2, x_] := 3;\nP[3, x_] := 11 + 2*x;\nP[n_, x_] := P[n, x] = Expand[-(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 - (2*n^2 - 12*n + 18)*x + x^2)*P[n - 4, x] + (4*n^3 - 30*n^2 + 76*n - 65 - (4*n - 10)*x)*P[n - 3, x] - (6*n^2 - 24*n + 25 - 2*x)*P[n - 2, 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 + 2*x; for(n = 4, N, my(i = n + 1); v[i] = -(n^4 - 12*n^3 + 54*n^2 - 108*n + 81 - (2*n^2 - 12*n + 18)*x + x^2)*v[i - 4] + (4*n^3 - 30*n^2 + 76*n - 65 - (4*n - 10)*x)*v[i - 3] - (6*n^2 - 24*n + 25 - 2*x)*v[i - 2] + (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"],"edges":["e-59d75b370e10c587","e-88634d2801bbb8bf"],"text":"A130534 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1"},"headline":"A130534 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1","chain":null}