{"id":"n-c31feacfee4079b7","revision":0,"first_index":0,"fingerprint":"f6-a45348decf901a8a","name":"theta_plus_one of one_plus_derivative of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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","2"],["4","14","6"],["7","56","87","24"],["11","160","555","584","120"],["16","370","2280","5284","4370","720"],["22","742","7140","28924","52220","36504","5040"],["29","1344","18606","116144","362145","549240","338436","40320"],["37","2256","42462","377328","1794345","4656168","6196484","3457152","362880"],["46","3570","87660","1050168","7049490","27668430","62528060","75082464","38632464","3628800"],["56","5390","167310","2596968","23340240","128421810","435984010","883504864","975702024","469166400","39916800"],["67","7832","299805","5849448","67726065","496048608","2347167515","7104482704","13171678740","13563563760","6155915040","479001600"],["79","11024","510081","12214488","176913165","1661208120","10412368967","43709798704","120450067452","207296104080","201106743552","86813544960","6227020800"],["92","15106","831012","23955932","424113690","4961330946","39701469808","219839147528","836599073310","2130952347160","3441654047832","3170757906432","1309802382720","87178291200"],["106","20230","1304940","44569252","946555610","13486691790","133970116280","943648297592","4719416613912","16538794235600","39386638170880","60202450011456","53003732775552","21055464138240","1307674368000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","24","174","1430","13040","130592","1426264","16889112","215731152","2958805872","43391741184","677866505472","11241894912768","197306267869440"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"],["4","14","6"]],"recurrence":{"denominator":{"coeffs":[["-4"],["8"],["-5"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","0","0"],["1","-6","12","-8"],["-2","15","-36","28"],["1","-12","39","-38"],["0","3","-18","25"],["0","0","3","-8"],["0","0","0","1"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["-7","18","-12"],["9","-39","36"],["-3","27","-39"],["0","-6","18"],["0","0","-3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-4","0"],["14","-12"],["-12","24"],["3","-15"],["0","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181223,"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-bfe70a6446da173c"]},{"id":181224,"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-bfe70a6446da173c"]},{"id":181225,"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-bfe70a6446da173c"]}],"region_exact":{},"incoming_edges":[{"id":"e-bfe70a6446da173c","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-c31feacfee4079b7","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":"82f622054a4b30ccf4d5d72c4dae1098a8f5f8bc81839827948b91e6cdaec516","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-51d4e271f3dd1e2d","role":"sequence","name":"one_plus_derivative of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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,    2;\n  2:  4,   14,     6;\n  3:  7,   56,    87,      24;\n  4: 11,  160,   555,     584,     120;\n  5: 16,  370,  2280,    5284,    4370,      720;\n  6: 22,  742,  7140,   28924,   52220,    36504,     5040;\n  7: 29, 1344, 18606,  116144,  362145,   549240,   338436,    40320;\n  8: 37, 2256, 42462,  377328, 1794345,  4656168,  6196484,  3457152,   362880;\n  9: 46, 3570, 87660, 1050168, 7049490, 27668430, 62528060, 75082464, 38632464, 3628800;\n","recurrence_sentence":"The row polynomials satisfy (n^3-5*n^2+8*n-4)*P(n,x) = (n^3-2*n^2+n+(3*n^4-12*n^3+15*n^2-6*n)*x+(3*n^5-18*n^4+39*n^3-36*n^2+12*n)*x^2+(n^6-8*n^5+25*n^4-38*n^3+28*n^2-8*n)*x^3)*P(n-3,x) - (3*n^3-9*n^2+7*n+(6*n^4-27*n^3+39*n^2-18*n)*x+(3*n^5-18*n^4+39*n^3-36*n^2+12*n)*x^2)*P(n-2,x) + (3*n^3-12*n^2+14*n-4+(3*n^4-15*n^3+24*n^2-12*n)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 2*x, P(2,x) = 4 + 14*x + 6*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[2, x_] := 4 + 14*x + 6*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n^3 - 2*n^2 + n + (3*n^4 - 12*n^3 + 15*n^2 - 6*n)*x + (3*n^5 - 18*n^4 + 39*n^3 - 36*n^2 + 12*n)*x^2 + (n^6 - 8*n^5 + 25*n^4 - 38*n^3 + 28*n^2 - 8*n)*x^3)*P[n - 3, x] - (3*n^3 - 9*n^2 + 7*n + (6*n^4 - 27*n^3 + 39*n^2 - 18*n)*x + (3*n^5 - 18*n^4 + 39*n^3 - 36*n^2 + 12*n)*x^2)*P[n - 2, x] + (3*n^3 - 12*n^2 + 14*n - 4 + (3*n^4 - 15*n^3 + 24*n^2 - 12*n)*x)*P[n - 1, x])/(n^3 - 5*n^2 + 8*n - 4)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 2*x; v[3] = 4 + 14*x + 6*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n^3 - 2*n^2 + n + (3*n^4 - 12*n^3 + 15*n^2 - 6*n)*x + (3*n^5 - 18*n^4 + 39*n^3 - 36*n^2 + 12*n)*x^2 + (n^6 - 8*n^5 + 25*n^4 - 38*n^3 + 28*n^2 - 8*n)*x^3)*v[i - 3] - (3*n^3 - 9*n^2 + 7*n + (6*n^4 - 27*n^3 + 39*n^2 - 18*n)*x + (3*n^5 - 18*n^4 + 39*n^3 - 36*n^2 + 12*n)*x^2)*v[i - 2] + (3*n^3 - 12*n^2 + 14*n - 4 + (3*n^4 - 15*n^3 + 24*n^2 - 12*n)*x)*v[i - 1])/(n^3 - 5*n^2 + 8*n - 4)); 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-4d60c3dd8627c01d","steps":["D+1","\u03b8+1"],"edges":["e-55797f5beaf34466","e-bfe70a6446da173c"],"text":"A094638 \u2192 D+1 \u2192 \u03b8+1"},"headline":"A094638 \u2192 D+1 \u2192 \u03b8+1","chain":null}