{"id":"n-77dad805f3db7972","revision":0,"first_index":1,"fingerprint":"f6-607f8746089a3f6e","name":"(I + A132440)^3: Coefficients for normalized generalized Laguerre polynomials n!*Lag(n, 3-n, -x).","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"],["3","1"],["6","6","1"],["6","18","9","1"],["0","24","36","12","1"],["0","0","60","60","15","1"],["0","0","0","120","90","18","1"],["0","0","0","0","210","126","21","1"],["0","0","0","0","0","336","168","24","1"],["0","0","0","0","0","0","504","216","27","1"],["0","0","0","0","0","0","0","720","270","30","1"],["0","0","0","0","0","0","0","0","990","330","33","1"],["0","0","0","0","0","0","0","0","0","1320","396","36","1"],["0","0","0","0","0","0","0","0","0","0","1716","468","39","1"],["0","0","0","0","0","0","0","0","0","0","0","2184","546","42","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","13","34","73","136","229","358","529","748","1021","1354","1753","2224","2773"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A235706","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["5","1"],["-1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":170198,"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-23b6014ad5393438"]},{"id":170199,"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-23b6014ad5393438"]},{"id":170200,"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-23b6014ad5393438"]}],"region_exact":{},"incoming_edges":[{"id":"e-23b6014ad5393438","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"0\",\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"0\",\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"0\",\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-77dad805f3db7972","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"a244fc25fe54cfb33c6b9105a6fbf24c5844f2e3489e15858c629b4eabb2d758","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-d16445f4fa1fddba","role":"sequence","name":"one_plus_derivative of Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the classical operator xDx, iterated Laguerre transforms, associated matrices of the list partition transform and general Euler transformation for sequences.","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":[{"id":"l-b5356932edeff97a","kind":"oeis_match","node_a_id":"n-77dad805f3db7972","node_b_id":null,"fingerprint":null,"oeis_id":"A235706","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A235706","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-ce3394509b0cb866","kind":"oeis_match","node_a_id":"n-77dad805f3db7972","node_b_id":null,"fingerprint":null,"oeis_id":"A135859","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A135859","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A235706","relation":"identification"},{"oeis_id":"A135859","relation":"match_row_sums"},{"oeis_id":"A235706","relation":"match_triangle"}],"bfiles":[{"node_id":"n-77dad805f3db7972","oeis_id":"A135859","target":"row_sums","oeis_offset":1,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":39,"oeis_terms_available":39,"term_count":200,"raw_size":2106},{"node_id":"n-77dad805f3db7972","oeis_id":"A235706","target":"triangle","oeis_offset":0,"first_row":1,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":6114}],"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: 3,  1;\n   3: 6,  6,  1;\n   4: 6, 18,  9,   1;\n   5: 0, 24, 36,  12,   1;\n   6: 0,  0, 60,  60,  15,   1;\n   7: 0,  0,  0, 120,  90,  18,   1;\n   8: 0,  0,  0,   0, 210, 126,  21,   1;\n   9: 0,  0,  0,   0,   0, 336, 168,  24,  1;\n  10: 0,  0,  0,   0,   0,   0, 504, 216, 27, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n-5-x)*P(n-1,x) + (n-2)*x*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[-(n - 5 - x)*P[n - 1, x] + (n - 2)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = -(n - 5 - x)*v[i - 1] + (n - 2)*x*v[i - 2]); 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}},{"oeis_id":"A235706","target":"triangle","first_row":1,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 3,  1;\n  2: 6,  6,  1;\n  3: 6, 18,  9,   1;\n  4: 0, 24, 36,  12,   1;\n  5: 0,  0, 60,  60,  15,   1;\n  6: 0,  0,  0, 120,  90,  18,   1;\n  7: 0,  0,  0,   0, 210, 126,  21,   1;\n  8: 0,  0,  0,   0,   0, 336, 168,  24,  1;\n  9: 0,  0,  0,   0,   0,   0, 504, 216, 27, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n-4-x)*P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[-(n - 4 - x)*P[n - 1, x] + (n - 1)*x*P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = -(n - 4 - x)*v[i - 1] + (n - 1)*x*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":1,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-1c11ffc3c4cd47ed","steps":["D+1","(1/n)D\u00b2+(2/n)D+1/n"],"edges":["e-9e777fb0c714fbf5","e-23b6014ad5393438"],"text":"A132440 \u2192 D+1 \u2192 (1/n)D\u00b2+(2/n)D+1/n"},"headline":"A235706: (I + A132440)^3: Coefficients for normalized generalized Laguerre polynomials n!*Lag(n, 3-n, -x).","chain":"A132440 \u2192 D+1 \u2192 (1/n)D\u00b2+(2/n)D+1/n"}