{"id":"n-3202cf200924ca0a","revision":0,"first_index":0,"fingerprint":"f6-eb1d45955591e332","name":"theta_plus_one_squared of basis_map_A008277 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"],["2","4"],["6","24","9"],["24","144","108","16"],["120","960","1080","320","25"],["720","7200","10800","4800","750","36"],["5040","60480","113400","67200","15750","1512","49"],["40320","564480","1270080","940800","294000","42336","2744","64"],["362880","5806080","15240960","13547520","5292000","1016064","98784","4608","81"],["3628800","65318400","195955200","203212800","95256000","22861440","2963520","207360","7290","100"],["39916800","798336000","2694384000","3193344000","1746360000","502951680","81496800","7603200","400950","11000","121"],["479001600","10538035200","39517632000","52690176000","32931360000","11064936960","2151515520","250905600","17641800","726000","15972","144"],["6227020800","149448499200","616475059200","913296384000","642161520000","246590023680","55939403520","7828254720","688030200","37752000","1245816","22464","169"],["87178291200","2266635571200","10199860070400","16621994188800","12985932960000","5609923038720","1454424491520","237457059840","25044299280","1717716000","75579504","2044224","30758","196"],["1307674368000","36614882304000","178497551232000","317328979968000","272704592160000","130898204236800","38178642902400","7123711795200","876550474800","72144072000","3967923960","143095680","3229590","41160","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","39","292","2505","24306","263431","3154824","41368977","589410910","9064804551","149641946796","2638693215769","49490245341642","983607047803815"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["-1","0"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["0","-2","1"],["-1","-2","2"],["-1","1","1"],["0","1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","1"],["0","-1","2"],["0","0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181550,"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-06f013a34dc61285"]},{"id":181551,"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-06f013a34dc61285"]},{"id":181552,"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-06f013a34dc61285"]},{"id":181553,"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-06f013a34dc61285"]}],"region_exact":{},"incoming_edges":[{"id":"e-06f013a34dc61285","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-3202cf200924ca0a","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":"26c3c3db22032426471da6f39a398ad23ee2d430f0c968872aa98e20af831cb8","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-011d67b73ad91983","role":"sequence","name":"basis_map_A008277 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-1fb424ea7780e0db","kind":"fingerprint_related","node_a_id":"n-600339540c4efc1c","node_b_id":"n-3202cf200924ca0a","fingerprint":"f6-eb1d45955591e332","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-eb1d45955591e332"},"other_id":"n-600339540c4efc1c","other":{"id":"n-600339540c4efc1c","name":"theta_plus_one of basis_map_A008277 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-eb1d45955591e332","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["2","8","3"]],"card_rows":[["1"],["1","2"],["2","8","3"],["6","36","27","4"]],"row_sums_preview":["1","3","13","73","501","4051","37633","394353"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["basis A008277","\u03b8+1"],"edges":["e-07cfebc08bea7e3c","e-ef6dedb3b88ad994"],"text":"A132393 \u2192 basis A008277 \u2192 \u03b8+1"},"headline":"A132393 \u2192 basis A008277 \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:       1;\n  1:       2,        4;\n  2:       6,       24,         9;\n  3:      24,      144,       108,        16;\n  4:     120,      960,      1080,       320,       25;\n  5:     720,     7200,     10800,      4800,      750,       36;\n  6:    5040,    60480,    113400,     67200,    15750,     1512,      49;\n  7:   40320,   564480,   1270080,    940800,   294000,    42336,    2744,     64;\n  8:  362880,  5806080,  15240960,  13547520,  5292000,  1016064,   98784,   4608,   81;\n  9: 3628800, 65318400, 195955200, 203212800, 95256000, 22861440, 2963520, 207360, 7290, 100;\n","recurrence_sentence":"The row polynomials satisfy -(n-n^2*x)*P(n,x) = -(n^2+n-(n^3+n^2-2*n-2)*x-(n^2+2*n+1)*x^2)*P(n-1,x) - ((n+1)*x-(n^2+2*n+1)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n^2 + n - (n^3 + n^2 - 2*n - 2)*x - (n^2 + 2*n + 1)*x^2)*P[n - 1, x] - ((n + 1)*x - (n^2 + 2*n + 1)*x^2)*D[P[n - 1, x], x])/(-n + n^2*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(n^2 + n - (n^3 + n^2 - 2*n - 2)*x - (n^2 + 2*n + 1)*x^2)*v[i - 1] - ((n + 1)*x - (n^2 + 2*n + 1)*x^2)*deriv(v[i - 1], x))/(-n + n^2*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-efe23a76953cf69d","steps":["basis A008277","(\u03b8+1)\u00b2"],"edges":["e-31e8b29857f291e5","e-06f013a34dc61285"],"text":"A130534 \u2192 basis A008277 \u2192 (\u03b8+1)\u00b2"},"headline":"A130534 \u2192 basis A008277 \u2192 (\u03b8+1)\u00b2","chain":null}