{"id":"n-3159219aa7264769","revision":0,"first_index":0,"fingerprint":"f6-261b35285a74aa4e","name":"theta_plus_one of Triangle of 4-Eulerian numbers.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","8"],["1","26","48"],["1","64","339","256"],["1","142","1593","3284","1280"],["1","300","6270","25880","26925","6144"],["1","618","22410","162040","328725","198414","28672"],["1","1256","75573","887200","3061475","3557304","1358119","131072"],["1","2534","245559","4455676","24179375","47060214","34407961","8809256","589824"],["1","5092","778488","21096824","171023230","514483284","625180808","306414352","54860481","2621440"],["1","10210","2427120","95805120","1118826450","4933950588","9178109640","7452761280","2562041205","330994850","11534336"],["1","20448","7480455","422054400","6911452650","43029620928","116053248654","143536235520","81748865925","20390223200","1947349371","50331648"],["1","40926","22870773","1817878820","40888079250","349408900548","1314384984738","2341980441744","2027565913005","839726744750","155996316201","11225885436","218103808"],["1","81884","69533154","7698436376","233980927075","2685241744488","13684775783532","33757386216672","41960645189703","26420075563100","8181855412786","1155777422184","63642228949","939524096"],["1","163802","210564678","32184408584","1304627271955","19761552929298","133386814907556","442096271012064","757416401644887","683807207528030","322497074495926","76348952218392","8339902220533","355842262454","4026531840"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","75","660","6300","65520","740880","9072000","119750400","1696464000","25686460800","414096883200","7083236160000","128152088064000","2445351068160000"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-8"],["0","0","-6"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4","4"],["0","0","-1","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","6"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":183612,"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-821ed82c2bbecdb8"]},{"id":183613,"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-821ed82c2bbecdb8"]},{"id":183614,"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-821ed82c2bbecdb8"]},{"id":183615,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-821ed82c2bbecdb8"]}],"region_exact":{},"incoming_edges":[{"id":"e-821ed82c2bbecdb8","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-3159219aa7264769","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":"fdd2fbcf23fbe6eb48cf12d7b6b59b2ce7391bb9254d770de897c30758d2f490","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-7e652d8a57b6dcff","role":"sequence","name":"Triangle of 4-Eulerian numbers.","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: 1,    8;\n  2: 1,   26,     48;\n  3: 1,   64,    339,      256;\n  4: 1,  142,   1593,     3284,      1280;\n  5: 1,  300,   6270,    25880,     26925,      6144;\n  6: 1,  618,  22410,   162040,    328725,    198414,     28672;\n  7: 1, 1256,  75573,   887200,   3061475,   3557304,   1358119,    131072;\n  8: 1, 2534, 245559,  4455676,  24179375,  47060214,  34407961,   8809256,   589824;\n  9: 1, 5092, 778488, 21096824, 171023230, 514483284, 625180808, 306414352, 54860481, 2621440;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2+6*n+8)*x^2*P(n-2,x) - ((n+4)*x^2-(n+4)*x^3)*d/dx P(n-2,x) + (1+(2*n+6)*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 8*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 8*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 + 6*n + 8)*x^2*P[n - 2, x] - ((n + 4)*x^2 - (n + 4)*x^3)*D[P[n - 2, x], x] + (1 + (2*n + 6)*x)*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 6*n + 8)*x^2*v[i - 2] - ((n + 4)*x^2 - (n + 4)*x^3)*deriv(v[i - 2], x) + (1 + (2*n + 6)*x)*v[i - 1] + (x - x^2)*deriv(v[i - 1], x)); 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-7e652d8a57b6dcff","steps":["\u03b8+1"],"edges":["e-821ed82c2bbecdb8"],"text":"A144698 \u2192 \u03b8+1"},"headline":"A144698 \u2192 \u03b8+1","chain":null}