{"id":"n-317a2ef12f8e68fe","revision":0,"first_index":0,"fingerprint":"f6-98b8e10712046853","name":"theta_plus_one_squared of gamma_polynomial of type_b_eulerian","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","16"],["1","80"],["1","288","720"],["1","928","8784"],["1","2864","68976","62464"],["1","8688","447984","1418240"],["1","26176","2630880","19484672","8864000"],["1","78656","14567904","211226624","323334400"],["1","236112","77794848","1996556288","6870508800","1862406144"],["1","708496","405974304","17295140864","111748486400","99634728960"],["1","2125664","2087259696","141274484736","1546209529600","3026995863552","542455746560"],["1","6377184","10627608240","1107663278080","19213678944000","68921622061056","40012546330624"],["1","19131760","53769382416","8433809873920","221383378912000","1311491796258816","1645882929295360","209045140013056"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","17","81","1009","9713","134305","1874913","31005729","549207585","10807502193","229085039025","5259025009809","129266144599185","3396290842867329"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-64","0"],["1","64","0"],["1","16","-160"],["0","-16","-208"],["0","0","144"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","6","-80","0"],["0","-4","80","0"],["0","-4","80","-288"],["0","0","16","-512"],["0","0","0","64"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","4","-16","0"],["0","0","-4","16","0"],["0","0","-4","32","-64"],["0","0","0","32","-128"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0"],["-1","0"],["0","-16"],["0","16"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","0"],["0","2","0"],["0","4","-16"],["0","0","-16"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181725,"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-9b7d94e4393704bf"]},{"id":181726,"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-9b7d94e4393704bf"]},{"id":181727,"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-9b7d94e4393704bf"]}],"region_exact":{},"incoming_edges":[{"id":"e-9b7d94e4393704bf","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-317a2ef12f8e68fe","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":"ddaa36d0b0c98d67677d8bc56c5960e42dddd0f42ea8e1ef3abae42c8073aa7c","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-7b489708d21ffcfe","role":"sequence","name":"gamma_polynomial of type_b_eulerian","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":[{"id":"l-d08512a57f249ada","kind":"fingerprint_related","node_a_id":"n-a843ab95b98f04cf","node_b_id":"n-317a2ef12f8e68fe","fingerprint":"f6-98b8e10712046853","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-98b8e10712046853"},"other_id":"n-a843ab95b98f04cf","other":{"id":"n-a843ab95b98f04cf","name":"theta_plus_one_squared of gamma_polynomial of Triangle read by rows: Eulerian numbers of type B, T(n,k) (1 <= k <= n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (2*n - 2*k + 1)*T(n-1, k-1) + (2*k - 1)*T(n-1, k).","first_index":1,"fingerprint":"f6-98b8e10712046853","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","16"]],"card_rows":[["1"],["1"],["1","16"],["1","80"]],"row_sums_preview":["1","1","17","81","1009","9713","134305","1874913"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-1be5eefbe5bc79ec","steps":["\u03b3","(\u03b8+1)\u00b2"],"edges":["e-af71d95d59cd25b7","e-914899072136e862"],"text":"A060187 \u2192 \u03b3 \u2192 (\u03b8+1)\u00b2"},"headline":"A060187 \u2192 \u03b3 \u2192 (\u03b8+1)\u00b2","chain":null}}],"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: 1;\n  2: 1,    16;\n  3: 1,    80;\n  4: 1,   288,      720;\n  5: 1,   928,     8784;\n  6: 1,  2864,    68976,     62464;\n  7: 1,  8688,   447984,   1418240;\n  8: 1, 26176,  2630880,  19484672,   8864000;\n  9: 1, 78656, 14567904, 211226624, 323334400;\n","recurrence_sentence":"The row polynomials satisfy n^2*P(n,x) = (n^2+n-(16*n^3-16*n^2-64*n+64)*x+(144*n^4-208*n^3-160*n^2)*x^2)*P(n-2,x) - ((4*n^2+4*n-6)*x-(16*n^3+80*n^2+80*n-80)*x^2-(64*n^4-512*n^3-288*n^2)*x^3)*d/dx P(n-2,x) - ((4*n^2+4*n-4)*x^2-(32*n^3+32*n^2+16*n-16)*x^3+(128*n^3+64*n^2)*x^4)*d^2/dx^2 P(n-2,x) - (n-(16*n^3-16*n^2)*x)*P(n-1,x) + ((4*n^2+2*n-2)*x-(16*n^3+16*n^2)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((n^2 + n - (16*n^3 - 16*n^2 - 64*n + 64)*x + (144*n^4 - 208*n^3 - 160*n^2)*x^2)*P[n - 2, x] - ((4*n^2 + 4*n - 6)*x - (16*n^3 + 80*n^2 + 80*n - 80)*x^2 - (64*n^4 - 512*n^3 - 288*n^2)*x^3)*D[P[n - 2, x], x] - ((4*n^2 + 4*n - 4)*x^2 - (32*n^3 + 32*n^2 + 16*n - 16)*x^3 + (128*n^3 + 64*n^2)*x^4)*D[P[n - 2, x], {x, 2}] - (n - (16*n^3 - 16*n^2)*x)*P[n - 1, x] + ((4*n^2 + 2*n - 2)*x - (16*n^3 + 16*n^2)*x^2)*D[P[n - 1, x], x])/(n^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((n^2 + n - (16*n^3 - 16*n^2 - 64*n + 64)*x + (144*n^4 - 208*n^3 - 160*n^2)*x^2)*v[i - 2] - ((4*n^2 + 4*n - 6)*x - (16*n^3 + 80*n^2 + 80*n - 80)*x^2 - (64*n^4 - 512*n^3 - 288*n^2)*x^3)*deriv(v[i - 2], x) - ((4*n^2 + 4*n - 4)*x^2 - (32*n^3 + 32*n^2 + 16*n - 16)*x^3 + (128*n^3 + 64*n^2)*x^4)*deriv(deriv(v[i - 2], x), x) - (n - (16*n^3 - 16*n^2)*x)*v[i - 1] + ((4*n^2 + 2*n - 2)*x - (16*n^3 + 16*n^2)*x^2)*deriv(v[i - 1], x))/(n^2)); 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-d8312bb744732845","steps":["\u03b3","(\u03b8+1)\u00b2"],"edges":["e-fcc9671b64420c56","e-9b7d94e4393704bf"],"text":"type_b_eulerian \u2192 \u03b3 \u2192 (\u03b8+1)\u00b2"},"headline":"type_b_eulerian \u2192 \u03b3 \u2192 (\u03b8+1)\u00b2","chain":null}