{"id":"n-ed7f37079a43bdf8","revision":0,"first_index":1,"fingerprint":"f6-9c7ee164876013bf","name":"theta_plus_one of Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2].","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"],["4","2"],["28","28","3"],["280","420","90","4"],["3640","7280","2340","208","5"],["58240","145600","62400","8320","400","6"],["1106560","3319680","1778400","316160","22800","684","7"],["24344320","85205120","54774720","12172160","1170400","52668","1078","8"],["608608000","2434432000","1825824000","486886400","58520000","3511200","107800","1600","9"],["17041024000","76684608000","65729664000","20449228800","2949408000","221205600","9055200","201600","2268","10"],["528271744000","2641358720000","2547024480000","905608704000","152386080000","13714747200","701778000","20832000","351540","3100","11"],["17961239296000","98786816128000","105843017280000","42337206912000","8141770560000","854885908800","52492994400","1947792000","43825320","579700","4114","12"],["664565853952000","3987395123712000","4699429967232000","2088635540992000","451868266080000","54224191929600","3884481585600","172963929600","4864610520","85795600","913308","5328","13"],["26582634158080000","172787122027520000","222154871178240000","108609048131584000","26107944262400000","3524572475424000","288561489216000","14990207232000","505919494080","11153428000","158306720","1385280","6760","14"],["1143053268797440000","8001372881582080000","11144769370775040000","5943876997746688000","1571698244596480000","235754736689472000","21714252063504000","1289157821952000","50760589239360","1342872731200","23825161360","277979520","2034760","8428","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","59","794","13473","274966","6544291","177720474","5417891009","183084397478","6789087439851","273979421280346","11950181340737569","560070261162316854","28063581037639810643"],"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":[["-2","-1"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["4","-2","0"],["-6","-5","1"],["0","3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-6","0"],["0","0","3"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":189343,"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-05741cbe3c335b92"]},{"id":189344,"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-05741cbe3c335b92"]},{"id":189345,"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-05741cbe3c335b92"]}],"region_exact":{},"incoming_edges":[{"id":"e-05741cbe3c335b92","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-ed7f37079a43bdf8","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":"81f6b9f23442b7c94a5dc71455b2faef201207d02aaf9587f8a069c29053630b","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-e18d516553291356","role":"sequence","name":"Triangle read by rows. A generalization of unsigned Lah numbers, called L[3,2].","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:           4,           2;\n   3:          28,          28,           3;\n   4:         280,         420,          90,           4;\n   5:        3640,        7280,        2340,         208,          5;\n   6:       58240,      145600,       62400,        8320,        400,         6;\n   7:     1106560,     3319680,     1778400,      316160,      22800,       684,       7;\n   8:    24344320,    85205120,    54774720,    12172160,    1170400,     52668,    1078,      8;\n   9:   608608000,  2434432000,  1825824000,   486886400,   58520000,   3511200,  107800,   1600,    9;\n  10: 17041024000, 76684608000, 65729664000, 20449228800, 2949408000, 221205600, 9055200, 201600, 2268, 10;\n","recurrence_sentence":"The row polynomials satisfy -(2-(n-1)*x)*P(n,x) = -(6*n-4-(3*n^2-5*n-2)*x-n*x^2)*P(n-1,x) - (6*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[(-(6*n - 4 - (3*n^2 - 5*n - 2)*x - n*x^2)*P[n - 1, x] - (6*x - 3*n*x^2)*D[P[n - 1, x], x])/(-2 + (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] = (-(6*n - 4 - (3*n^2 - 5*n - 2)*x - n*x^2)*v[i - 1] - (6*x - 3*n*x^2)*deriv(v[i - 1], x))/(-2 + (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-e18d516553291356","steps":["\u03b8+1"],"edges":["e-05741cbe3c335b92"],"text":"A290598 \u2192 \u03b8+1"},"headline":"A290598 \u2192 \u03b8+1","chain":null}