{"id":"n-4c99c4c80965c995","revision":0,"first_index":1,"fingerprint":"f6-53929619dc0d0749","name":"theta_plus_one of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,1].","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","2"],["10","20","3"],["80","240","72","4"],["880","3520","1584","176","5"],["12320","61600","36960","6160","350","6"],["209440","1256640","942480","209440","17850","612","7"],["4188800","29321600","26389440","7330400","833000","42840","980","8"],["96342400","770739200","809276160","269758720","38318000","2627520","90160","1472","9"],["2504902400","22544121600","27052945920","10520590080","1793282400","153709920","7032480","172224","2106","10"],["72642169600","726421696000","980669289600","435853017600","86675316000","8915175360","509854800","16648320","305370","2900","11"],["2324549427200","25570043699200","38355065548800","19177532774400","4358530176000","523023621120","35893777920","1465052160","35830080","510400","3872","12"],["81359229952000","976310759424000","1610912753049600","894951529472000","228822834240000","31381417267200","2512564454400","123064381440","3762158400","71456000","813120","5040","13"],["3091650738176000","40191459596288000","72344627273318400","44210605555916800","12559831123840000","1937802516249600","177315262924800","10132300738560","371701249920","8824816000","133893760","1244880","6422","14"],["126757680265216000","1774607523713024000","3460484671240396800","2306989780826931200","720934306508416000","123588738258585600","12722370114854400","830848660561920","35559419575680","1013088876800","19213754560","238187040","1843114","8036","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","33","396","6165","117396","2636469","68107068","1987153641","64576759140","2311703475561","90346140421164","3826377986673213","174523805028663156","8526952511550231165"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-4","-1"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["16","-4","0"],["-12","-7","1"],["0","3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-12","0"],["0","0","3"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":187952,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-c8281b6608b44325"]},{"id":187953,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-c8281b6608b44325"]},{"id":187954,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-c8281b6608b44325"]}],"region_exact":{},"incoming_edges":[{"id":"e-c8281b6608b44325","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-4c99c4c80965c995","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":"f8058021be8e0227c9f093ed4711f8771c5b3f97eacfa01a0cf5f69b9f20404a","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-33e7d067844832dd","role":"sequence","name":"Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,1].","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, 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":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:          1;\n   2:          2,           2;\n   3:         10,          20,           3;\n   4:         80,         240,          72,           4;\n   5:        880,        3520,        1584,         176,          5;\n   6:      12320,       61600,       36960,        6160,        350,         6;\n   7:     209440,     1256640,      942480,      209440,      17850,       612,       7;\n   8:    4188800,    29321600,    26389440,     7330400,     833000,     42840,     980,      8;\n   9:   96342400,   770739200,   809276160,   269758720,   38318000,   2627520,   90160,   1472,    9;\n  10: 2504902400, 22544121600, 27052945920, 10520590080, 1793282400, 153709920, 7032480, 172224, 2106, 10;\n","recurrence_sentence":"The row polynomials satisfy -(4-(n-1)*x)*P(n,x) = -(12*n-16-(3*n^2-7*n-4)*x-n*x^2)*P(n-1,x) - (12*x-3*n*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(12*n - 16 - (3*n^2 - 7*n - 4)*x - n*x^2)*P[n - 1, x] - (12*x - 3*n*x^2)*D[P[n - 1, x], x])/(-4 + (n - 1)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(12*n - 16 - (3*n^2 - 7*n - 4)*x - n*x^2)*v[i - 1] - (12*x - 3*n*x^2)*deriv(v[i - 1], x))/(-4 + (n - 1)*x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-33e7d067844832dd","steps":["\u03b8+1"],"edges":["e-c8281b6608b44325"],"text":"A290596 \u2192 \u03b8+1"},"headline":"A290596 \u2192 \u03b8+1","chain":null}