{"id":"n-3f4ccde57d57bff1","revision":1,"first_index":0,"fingerprint":"f6-aa53210b1406856d","name":"theta_plus_one 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":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","2"],["2","6","3"],["6","22","18","4"],["24","100","105","40","5"],["120","548","675","340","75","6"],["720","3528","4872","2940","875","126","7"],["5040","26136","39396","27076","9800","1932","196","8"],["40320","219168","354372","269136","112245","27216","3822","288","9"],["362880","2053152","3518100","2894720","1346625","379638","66150","6960","405","10"],["3628800","21257280","38260728","33638000","17084650","5412330","1104411","145200","11880","550","11"],["39916800","241087680","452753928","421032304","229978650","80037210","18462906","2859384","294030","19250","726","12"],["479001600","2972885760","5794678656","5656059552","3286034180","1236420900","314931617","55413072","6745167","557700","29887","936","13"],["6227020800","39605518080","79790151168","81255012384","49788518780","20016712716","5536602071","1080291784","150026877","14744730","1002001","44772","1183","14"],["87178291200","566931294720","1176470393472","1243957041600","798608028400","339980200560","100865260496","21451630200","3315704535","373122750","30247217","1719900","65065","1470","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","11","50","274","1764","13068","109584","1026576","10628640","120543840","1486442880","19802759040","283465647360","4339163001600"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","2","-1"],["2","-2","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","2"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165618,"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-e88c1b7209f2708f"]},{"id":165619,"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-e88c1b7209f2708f"]},{"id":165620,"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-e88c1b7209f2708f"]},{"id":165621,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-e88c1b7209f2708f"]}],"region_exact":{},"incoming_edges":[{"id":"e-e88c1b7209f2708f","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-3f4ccde57d57bff1","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":"b1f2739f59893f04584294b51de53e627922e66cd950c2a99385de702f681678","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-efe23a76953cf69d","role":"sequence","name":"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-bd2045343e5b105c","kind":"fingerprint_related","node_a_id":"n-0b6da90e76b5fd69","node_b_id":"n-3f4ccde57d57bff1","fingerprint":"f6-aa53210b1406856d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-aa53210b1406856d"},"other_id":"n-0b6da90e76b5fd69","other":{"id":"n-0b6da90e76b5fd69","name":"derivative 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-aa53210b1406856d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["1","2"]],"card_rows":[["1"],["1","2"],["2","6","3"],["6","22","18","4"]],"row_sums_preview":["0","1","3","11","50","274","1764","13068"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["D"],"edges":["e-55ee0b1ee1acb060"],"text":"A132393 \u2192 D"},"headline":"A132393 \u2192 D","chain":null}},{"id":"l-005ea072cac4c4f8","kind":"oeis_match","node_a_id":"n-3f4ccde57d57bff1","node_b_id":null,"fingerprint":null,"oeis_id":"A000254","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A000254","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-577c97523a1f3b5a","kind":"oeis_match","node_a_id":"n-3f4ccde57d57bff1","node_b_id":null,"fingerprint":null,"oeis_id":"A028421","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":9,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":9,"target":"triangle","terms_compared":45},"in_catalog":true,"oeis_id":"A028421","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A000254","relation":"match_row_sums"},{"oeis_id":"A028421","relation":"match_triangle"}],"bfiles":[{"node_id":"n-3f4ccde57d57bff1","oeis_id":"A028421","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":45,"oeis_terms_agreeing":45,"oeis_terms_available":45,"term_count":990,"raw_size":27868}],"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:      1;\n  1:      1,       2;\n  2:      2,       6,       3;\n  3:      6,      22,      18,       4;\n  4:     24,     100,     105,      40,       5;\n  5:    120,     548,     675,     340,      75,      6;\n  6:    720,    3528,    4872,    2940,     875,    126,     7;\n  7:   5040,   26136,   39396,   27076,    9800,   1932,   196,    8;\n  8:  40320,  219168,  354372,  269136,  112245,  27216,  3822,  288,   9;\n  9: 362880, 2053152, 3518100, 2894720, 1346625, 379638, 66150, 6960, 405, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-2*n+1+(2*n-2)*x+x^2)*P(n-2,x) + (2*n-1+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 2*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 2*n + 1 + (2*n - 2)*x + x^2)*P[n - 2, x] + (2*n - 1 + 2*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 2*n + 1 + (2*n - 2)*x + x^2)*v[i - 2] + (2*n - 1 + 2*x)*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}},{"oeis_id":"A028421","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:      1;\n  1:      1,       2;\n  2:      2,       6,       3;\n  3:      6,      22,      18,       4;\n  4:     24,     100,     105,      40,       5;\n  5:    120,     548,     675,     340,      75,      6;\n  6:    720,    3528,    4872,    2940,     875,    126,     7;\n  7:   5040,   26136,   39396,   27076,    9800,   1932,   196,    8;\n  8:  40320,  219168,  354372,  269136,  112245,  27216,  3822,  288,   9;\n  9: 362880, 2053152, 3518100, 2894720, 1346625, 379638, 66150, 6960, 405, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-2*n+1+(2*n-2)*x+x^2)*P(n-2,x) + (2*n-1+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 2*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 2*n + 1 + (2*n - 2)*x + x^2)*P[n - 2, x] + (2*n - 1 + 2*x)*P[n - 1, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 2*n + 1 + (2*n - 2)*x + x^2)*v[i - 2] + (2*n - 1 + 2*x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-efe23a76953cf69d","steps":["\u03b8+1"],"edges":["e-e88c1b7209f2708f"],"text":"A130534 \u2192 \u03b8+1"},"headline":"A130534 \u2192 \u03b8+1","chain":null}