{"id":"n-741874bf2346879a","revision":0,"first_index":1,"fingerprint":"f6-3c9a530453f07c86","name":"theta_plus_one_squared of Triangle of second-order 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","8"],["1","32","54"],["1","88","522","384"],["1","208","2952","7104","3000"],["1","456","13068","70400","92700","25920"],["1","960","50490","513920","1453500","1223424","246960"],["1","1976","179550","3132800","16100500","28270944","16715664","2580480"],["1","4016","605340","17000000","144137500","447842304","540288504","238970880","29393280"],["1","8104","1969632","85218560","1119125000","5592865824","11706340296","10379962368","3591462240","362880000"],["1","16288","6255342","403902464","7859243000","59341834944","196132059312","297098492928","203105978496","56835648000","4829932800"],["1","32664","19535634","1838022016","51287069400","559762588224","2746028540416","6475547713536","7468183008144","4078830182400","947154003840","68976230400"],["1","65424","60297264","8116148416","316745444400","4835643128064","33698282272816","116364073107456","206539103347344","188307966182400","84449461852800","16608396349440","1052366515200"],["1","130952","184571892","35037276928","1875401305700","39048354446976","374106775320208","1811194244231168","4657044250631952","6472837513987200","4802438944752768","1807330178580480","306057742099200","17086945075200"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","9","87","995","13265","202545","3489255","66981915","1418241825","32839832025","825613363575","22397626926675","652180214711025","20289055572410625"],"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":[["-5"],["2"]]},"terms":[{"coeff":{"coeffs":[["0","-72","-870"],["0","72","1178"],["0","-16","-512"],["0","0","72"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","6","50","-600"],["0","-4","-56","740"],["0","0","16","-280"],["0","0","0","32"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","3","62","-65"],["0","0","-2","-64","66"],["0","0","0","16","-16"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-5","80"],["2","-72"],["0","16"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-8","-60"],["0","4","64"],["0","0","-16"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181083,"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-f641d0a131833270"]},{"id":181084,"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-f641d0a131833270"]},{"id":181085,"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-f641d0a131833270"]},{"id":181086,"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-f641d0a131833270"]}],"region_exact":{},"incoming_edges":[{"id":"e-f641d0a131833270","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-741874bf2346879a","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":"11a0e67012f05cdb1ac246b2243b5931b444caf04938474c7a731420c47e0762","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-e2f0f447a502f269","role":"sequence","name":"Triangle of second-order 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-84751b56e477063d","kind":"fingerprint_related","node_a_id":"n-741874bf2346879a","node_b_id":"n-a6a9ef684f8dadd1","fingerprint":"f6-3c9a530453f07c86","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3c9a530453f07c86"},"other_id":"n-a6a9ef684f8dadd1","other":{"id":"n-a6a9ef684f8dadd1","name":"theta_plus_one_squared of Second-order Eulerian triangle T(n,k), 1 <= k <= n.","first_index":0,"fingerprint":"f6-3c9a530453f07c86","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","8"],["1","32","54"]],"card_rows":[["1"],["1","8"],["1","32","54"],["1","88","522","384"]],"row_sums_preview":["1","9","87","995","13265","202545","3489255","66981915"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-d4c21302c908a2cf","steps":["(\u03b8+1)\u00b2"],"edges":["e-186d43e65110e329"],"text":"A008517 \u2192 (\u03b8+1)\u00b2"},"headline":"A008517 \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,    8;\n   4: 1,   32,     54;\n   5: 1,   88,    522,      384;\n   6: 1,  208,   2952,     7104,      3000;\n   7: 1,  456,  13068,    70400,     92700,     25920;\n   8: 1,  960,  50490,   513920,   1453500,   1223424,    246960;\n   9: 1, 1976, 179550,  3132800,  16100500,  28270944,  16715664,   2580480;\n  10: 1, 4016, 605340, 17000000, 144137500, 447842304, 540288504, 238970880, 29393280;\n","recurrence_sentence":"The row polynomials satisfy (2*n-5)*P(n,x) = -((16*n^2-72*n+72)*x-(72*n^3-512*n^2+1178*n-870)*x^2)*P(n-2,x) - ((4*n-6)*x-(16*n^2-56*n+50)*x^2-(32*n^3-280*n^2+740*n-600)*x^3)*d/dx P(n-2,x) - ((2*n-3)*x^2-(16*n^2-64*n+62)*x^3+(16*n^2-66*n+65)*x^4)*d^2/dx^2 P(n-2,x) + (2*n-5+(16*n^2-72*n+80)*x)*P(n-1,x) + ((4*n-8)*x-(16*n^2-64*n+60)*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[(-((16*n^2 - 72*n + 72)*x - (72*n^3 - 512*n^2 + 1178*n - 870)*x^2)*P[n - 2, x] - ((4*n - 6)*x - (16*n^2 - 56*n + 50)*x^2 - (32*n^3 - 280*n^2 + 740*n - 600)*x^3)*D[P[n - 2, x], x] - ((2*n - 3)*x^2 - (16*n^2 - 64*n + 62)*x^3 + (16*n^2 - 66*n + 65)*x^4)*D[P[n - 2, x], {x, 2}] + (2*n - 5 + (16*n^2 - 72*n + 80)*x)*P[n - 1, x] + ((4*n - 8)*x - (16*n^2 - 64*n + 60)*x^2)*D[P[n - 1, x], x])/(2*n - 5)]];\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] = (-((16*n^2 - 72*n + 72)*x - (72*n^3 - 512*n^2 + 1178*n - 870)*x^2)*v[i - 2] - ((4*n - 6)*x - (16*n^2 - 56*n + 50)*x^2 - (32*n^3 - 280*n^2 + 740*n - 600)*x^3)*deriv(v[i - 2], x) - ((2*n - 3)*x^2 - (16*n^2 - 64*n + 62)*x^3 + (16*n^2 - 66*n + 65)*x^4)*deriv(deriv(v[i - 2], x), x) + (2*n - 5 + (16*n^2 - 72*n + 80)*x)*v[i - 1] + ((4*n - 8)*x - (16*n^2 - 64*n + 60)*x^2)*deriv(v[i - 1], x))/(2*n - 5)); 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-e2f0f447a502f269","steps":["(\u03b8+1)\u00b2"],"edges":["e-f641d0a131833270"],"text":"A201637 \u2192 (\u03b8+1)\u00b2"},"headline":"A201637 \u2192 (\u03b8+1)\u00b2","chain":null}