{"id":"n-e6cef00316b8374e","revision":0,"first_index":0,"fingerprint":"f6-5ba588c0146f16d0","name":"theta_plus_one of Array of coefficients of denominator polynomials of the n-th approximation of the continued fraction x/(1+x/(2+x/(3+..., related to Laguerre polynomial coefficients.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","2"],["6","8"],["24","36","3"],["120","192","27"],["720","1200","216","4"],["5040","8640","1800","64"],["40320","70560","16200","800","5"],["362880","645120","158760","9600","125"],["3628800","6531840","1693440","117600","2250","6"],["39916800","72576000","19595520","1505280","36750","216"],["479001600","878169600","244944000","20321280","588000","5292","7"],["6227020800","11496038400","3293136000","290304000","9525600","112896","343"],["87178291200","161902540800","47421158400","4390848000","158760000","2286144","10976","8"],["1307674368000","2440992153600","728561433600","70253568000","2744280000","45722880","296352","512"]],"degrees":[0,1,1,2,2,3,3,4,4,5,5,6,6,7,7],"row_sums":["1","4","14","63","339","2140","15544","127885","1176485","11973936","133630566","1623029779","21316138039","301053895528","4550271822944"],"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"],["6","8"],["24","36","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["0","-2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["1","0"],["-1","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180183,"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-58421abae90fba29"]},{"id":180184,"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-58421abae90fba29"]},{"id":180185,"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-58421abae90fba29"]}],"region_exact":{},"incoming_edges":[{"id":"e-58421abae90fba29","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-e6cef00316b8374e","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":"fa2fdd3496bda2ca0a858ed2959de8fcb00b98c94ff519a966ef2c179d652995","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-8b17fbdec05b5547","role":"sequence","name":"Array of coefficients of denominator polynomials of the n-th approximation of the continued fraction x/(1+x/(2+x/(3+..., related to Laguerre polynomial coefficients.","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:       6,       8;\n  3:      24,      36,       3;\n  4:     120,     192,      27;\n  5:     720,    1200,     216,      4;\n  6:    5040,    8640,    1800,     64;\n  7:   40320,   70560,   16200,    800,    5;\n  8:  362880,  645120,  158760,   9600,  125;\n  9: 3628800, 6531840, 1693440, 117600, 2250, 6;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -x^2*P(n-4,x) - (2*n-2)*x*P(n-3,x) - (n^2-n-2*x)*P(n-2,x) + 2*n*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + 2*x, P(2,x) = 6 + 8*x, P(3,x) = 24 + 36*x + 3*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[2, x_] := 6 + 8*x;\nP[3, x_] := 24 + 36*x + 3*x^2;\nP[n_, x_] := P[n, x] = Expand[-x^2*P[n - 4, x] - (2*n - 2)*x*P[n - 3, x] - (n^2 - n - 2*x)*P[n - 2, x] + 2*n*P[n - 1, 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 + 2*x; v[3] = 6 + 8*x; v[4] = 24 + 36*x + 3*x^2; for(n = 4, N, my(i = n + 1); v[i] = -x^2*v[i - 4] - (2*n - 2)*x*v[i - 3] - (n^2 - n - 2*x)*v[i - 2] + 2*n*v[i - 1]); 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-8b17fbdec05b5547","steps":["\u03b8+1"],"edges":["e-58421abae90fba29"],"text":"A084950 \u2192 \u03b8+1"},"headline":"A084950 \u2192 \u03b8+1","chain":null}