{"id":"n-11f5844271190e7f","revision":1,"first_index":1,"fingerprint":"f6-3b4269c91cbc7ccc","name":"theta_plus_one_squared of Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","4"],["1","16","9"],["1","44","99","16"],["1","104","594","416","25"],["1","228","2718","4832","1425","36"],["1","480","10719","38656","29775","4320","49"],["1","988","38637","249904","390475","154548","12103","64"],["1","2008","131472","1411744","3904750","3176424","715792","32128","81"],["1","4052","430560","7283072","32758850","47172744","22304408","3061760","82053","100"],["1","8144","1373733","35255808","243452850","566072928","477167586","141023232","12363597","203600","121"],["1","16332","4304439","163002960","1657961850","5850442296","7963102014","4244382336","825202485","47827100","494043","144"],["1","32712","13317534","728535200","10582038375","54202374288","111483428196","96359776512","34285804335","4553345000","179046846","1177632","169"],["1","65476","40835826","3174572576","64293554375","462357463068","1370587628508","1790155269888","1040304291903","257174217500","24007705106","653373216","2766361","196"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","5","26","160","1140","9240","84000","846720","9374400","113097600","1476921600","20756736000","312388876800","5012751744000"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-12","-66"],["0","16","109"],["0","-4","-56"],["0","0","9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","2","5","-62"],["0","-2","-8","91"],["0","0","4","-38"],["0","0","0","4"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","1","9","-10"],["0","0","-1","-12","13"],["0","0","0","4","-4"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-2","16"],["1","-16"],["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-3","-8"],["0","2","12"],["0","0","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164528,"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-55c66a5e0fb07f9a"]},{"id":164529,"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-55c66a5e0fb07f9a"]},{"id":164530,"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-55c66a5e0fb07f9a"]},{"id":164531,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-55c66a5e0fb07f9a"]}],"region_exact":{},"incoming_edges":[{"id":"e-55c66a5e0fb07f9a","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-11f5844271190e7f","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":"afb2cc6fe5b317091e875ad1d5afcf336883aa9eeb9ee7cbfe0c2aacecdd5172","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-efd1fdf07e5468d8","role":"sequence","name":"Euler's triangle: triangle of Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.","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-2413ad48b632237e","kind":"fingerprint_related","node_a_id":"n-11f5844271190e7f","node_b_id":"n-ecf4607c39fc2a4b","fingerprint":"f6-3b4269c91cbc7ccc","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3b4269c91cbc7ccc"},"other_id":"n-ecf4607c39fc2a4b","other":{"id":"n-ecf4607c39fc2a4b","name":"theta_plus_one_squared of eulerian","first_index":1,"fingerprint":"f6-3b4269c91cbc7ccc","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","4"],["1","16","9"]],"card_rows":[["1"],["1","4"],["1","16","9"],["1","44","99","16"]],"row_sums_preview":["1","5","26","160","1140","9240","84000","846720"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-ff270bcb802a85af","steps":["(\u03b8+1)\u00b2"],"edges":["e-3a7fca57ac79b222"],"text":"A008292 \u2192 (\u03b8+1)\u00b2"},"headline":"A008292 \u2192 (\u03b8+1)\u00b2","chain":null}}],"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: 1;\n   3: 1,    4;\n   4: 1,   16,      9;\n   5: 1,   44,     99,      16;\n   6: 1,  104,    594,     416,      25;\n   7: 1,  228,   2718,    4832,    1425,      36;\n   8: 1,  480,  10719,   38656,   29775,    4320,     49;\n   9: 1,  988,  38637,  249904,  390475,  154548,  12103,    64;\n  10: 1, 2008, 131472, 1411744, 3904750, 3176424, 715792, 32128, 81;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = -((4*n^2-16*n+12)*x-(9*n^3-56*n^2+109*n-66)*x^2)*P(n-2,x) - ((2*n-2)*x-(4*n^2-8*n+5)*x^2-(4*n^3-38*n^2+91*n-62)*x^3)*d/dx P(n-2,x) - ((n-1)*x^2-(4*n^2-12*n+9)*x^3+(4*n^2-13*n+10)*x^4)*d^2/dx^2 P(n-2,x) + (n-2+(4*n^2-16*n+16)*x)*P(n-1,x) + ((2*n-3)*x-(4*n^2-12*n+8)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-((4*n^2 - 16*n + 12)*x - (9*n^3 - 56*n^2 + 109*n - 66)*x^2)*P[n - 2, x] - ((2*n - 2)*x - (4*n^2 - 8*n + 5)*x^2 - (4*n^3 - 38*n^2 + 91*n - 62)*x^3)*D[P[n - 2, x], x] - ((n - 1)*x^2 - (4*n^2 - 12*n + 9)*x^3 + (4*n^2 - 13*n + 10)*x^4)*D[P[n - 2, x], {x, 2}] + (n - 2 + (4*n^2 - 16*n + 16)*x)*P[n - 1, x] + ((2*n - 3)*x - (4*n^2 - 12*n + 8)*x^2)*D[P[n - 1, x], x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; for(n = 3, N, my(i = n); v[i] = (-((4*n^2 - 16*n + 12)*x - (9*n^3 - 56*n^2 + 109*n - 66)*x^2)*v[i - 2] - ((2*n - 2)*x - (4*n^2 - 8*n + 5)*x^2 - (4*n^3 - 38*n^2 + 91*n - 62)*x^3)*deriv(v[i - 2], x) - ((n - 1)*x^2 - (4*n^2 - 12*n + 9)*x^3 + (4*n^2 - 13*n + 10)*x^4)*deriv(deriv(v[i - 2], x), x) + (n - 2 + (4*n^2 - 16*n + 16)*x)*v[i - 1] + ((2*n - 3)*x - (4*n^2 - 12*n + 8)*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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-efd1fdf07e5468d8","steps":["(\u03b8+1)\u00b2"],"edges":["e-55c66a5e0fb07f9a"],"text":"A173018 \u2192 (\u03b8+1)\u00b2"},"headline":"A173018 \u2192 (\u03b8+1)\u00b2","chain":null}