{"id":"n-bb38c1d358a3999c","revision":0,"first_index":0,"fingerprint":"f6-78e837b0826284b4","name":"theta_plus_one_squared of basis_map_A013610 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","12"],["6","60","81"],["24","312","729","432"],["120","1848","5751","6048","2025"],["720","12528","46980","66960","40500","8748"],["5040","96336","413424","719280","597375","236196","35721"],["40320","831168","3957660","7959168","8150625","4470228","1250235","139968"],["362880","7964352","41229324","92740032","110664225","75442752","29505546","6158592","531441"],["3628800","83998080","466052616","1147290048","1541361150","1232496972","603113364","177199488","28697814","1968300"],["39916800","967524480","5693565816","15105804480","22332894750","20216146860","11666942973","4312414080","988480260","127939500","7144929"],["479001600","12089295360","74853580032","211635338112","338803195500","339071867640","222552582021","97464337344","28235460330","5196312000","550159533","25509168"],["6227020800","162908858880","1054699284096","3150478488960","5396482188900","5871564083880","4277727025803","2139079155840","737120890143","172127835000","26014686489","2295825120","89813529"],["87178291200","2355448273920","15865424774784","49731761693952","90318618561600","105514700230368","83863731703752","46708814078784","18441508631832","5139867060900","989029651896","125020432368","9340607016","312487308"],["1307674368000","36377863603200","253880647470720","830592024208128","1587896911364400","1972896935641632","1688807668163616","1029241119082176","453970157932863","145399889735100","33493162209507","5406387556752","580285210869","37185989652","1076168025"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","14","147","1497","15792","176436","2103372","26799372","364599144","5285806632","81458774928","1330956638640","22996815157440","419150756479680","8039888988704640"],"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"],["2","12"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","81"],["0","-12","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","36"],["0","0","12","0"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","12"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-12"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":183673,"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-96bcb9de644eb07a"]},{"id":183674,"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-96bcb9de644eb07a"]},{"id":183675,"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-96bcb9de644eb07a"]},{"id":183676,"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-96bcb9de644eb07a"]}],"region_exact":{},"incoming_edges":[{"id":"e-96bcb9de644eb07a","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-bb38c1d358a3999c","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":"95fd392aa14e378012cfb1af27f4a50516817baf6cafb78bb43b692edc84e7b8","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-c89ee0d57229b178","role":"sequence","name":"basis_map_A013610 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:       1;\n  1:       2,       12;\n  2:       6,       60,        81;\n  3:      24,      312,       729,        432;\n  4:     120,     1848,      5751,       6048,       2025;\n  5:     720,    12528,     46980,      66960,      40500,       8748;\n  6:    5040,    96336,    413424,     719280,     597375,     236196,     35721;\n  7:   40320,   831168,   3957660,    7959168,    8150625,    4470228,   1250235,    139968;\n  8:  362880,  7964352,  41229324,   92740032,  110664225,   75442752,  29505546,   6158592,   531441;\n  9: 3628800, 83998080, 466052616, 1147290048, 1541361150, 1232496972, 603113364, 177199488, 28697814, 1968300;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2+12*n*x-81*x^2)*P(n-2,x) + (12*n*x^2+36*x^3)*d/dx P(n-2,x) + (2*n+1+12*x)*P(n-1,x) - 12*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 12*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 12*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 + 12*n*x - 81*x^2)*P[n - 2, x] + (12*n*x^2 + 36*x^3)*D[P[n - 2, x], x] + (2*n + 1 + 12*x)*P[n - 1, x] - 12*x^2*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 12*n*x - 81*x^2)*v[i - 2] + (12*n*x^2 + 36*x^3)*deriv(v[i - 2], x) + (2*n + 1 + 12*x)*v[i - 1] - 12*x^2*deriv(v[i - 1], 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 A013610","(\u03b8+1)\u00b2"],"edges":["e-4deb1a58186d6d0a","e-96bcb9de644eb07a"],"text":"A130534 \u2192 basis A013610 \u2192 (\u03b8+1)\u00b2"},"headline":"A130534 \u2192 basis A013610 \u2192 (\u03b8+1)\u00b2","chain":null}
