{"id":"n-bec2f5b5cf01349e","revision":0,"first_index":0,"fingerprint":"f6-c55a407215dc8701","name":"theta_plus_one of Interpolating the factorial and the powers of 2. Triangle read by rows, T(n, k) for 0 <= k <= n.","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","4"],["2","16","12"],["6","72","108","32"],["24","384","864","512","80"],["120","2400","7200","6400","2000","192"],["720","17280","64800","76800","36000","6912","448"],["5040","141120","635040","940800","588000","169344","21952","1024"],["40320","1290240","6773760","12042240","9408000","3612672","702464","65536","2304"],["362880","13063680","78382080","162570240","152409600","73156608","18966528","2654208","186624","5120"],["3628800","145152000","979776000","2322432000","2540160000","1463132160","474163200","88473600","9331200","512000","11264"],["39916800","1756339200","13172544000","35126784000","43908480000","29506498560","11474749440","2676326400","376358400","30976000","1362944","24576"],["479001600","22992076800","189684633600","562028544000","790352640000","606990827520","275393986560","77078200320","13548902400","1486848000","98131968","3538944","53248"],["6227020800","323805081600","2914245734400","9498282393600","14841066240000","12822681231360","6648797675520","2171035975680","457952901120","62819328000","5528100864","299040768","8998912","114688"],["87178291200","4881984307200","47599346995200","169242122649600","290884898304000","279249502371840","162895543050240","60789007319040","14959794769920","2462517657600","270876942336","19537330176","881893376","22478848","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","30","218","1864","18312","202960","2502320","33937536","501757568","8026772224","138070360320","2540137384960","49752749837312","1033343214606336"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1","0"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["0","-4","4"],["-1","0","4"],["0","2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","2"],["0","0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":182838,"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-184005069033f139"]},{"id":182839,"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-184005069033f139"]},{"id":182840,"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-184005069033f139"]}],"region_exact":{},"incoming_edges":[{"id":"e-184005069033f139","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-bec2f5b5cf01349e","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":"f48d009f0f730ef56e86ff69a24bb0d6b00a7194f5e6b924730effe9d2e3eae3","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-8b66c9f49e6d2f0a","role":"sequence","name":"Interpolating the factorial and the powers of 2. Triangle read by rows, T(n, k) for 0 <= k <= n.","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,        4;\n  2:      2,       16,       12;\n  3:      6,       72,      108,        32;\n  4:     24,      384,      864,       512,        80;\n  5:    120,     2400,     7200,      6400,      2000,      192;\n  6:    720,    17280,    64800,     76800,     36000,     6912,      448;\n  7:   5040,   141120,   635040,    940800,    588000,   169344,    21952,    1024;\n  8:  40320,  1290240,  6773760,  12042240,   9408000,  3612672,   702464,   65536,   2304;\n  9: 362880, 13063680, 78382080, 162570240, 152409600, 73156608, 18966528, 2654208, 186624, 5120;\n","recurrence_sentence":"The row polynomials satisfy -(1-2*n*x)*P(n,x) = -(n-(2*n^2-4)*x-(4*n+4)*x^2)*P(n-1,x) - (x-(2*n+2)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - (2*n^2 - 4)*x - (4*n + 4)*x^2)*P[n - 1, x] - (x - (2*n + 2)*x^2)*D[P[n - 1, x], x])/(-1 + 2*n*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(n - (2*n^2 - 4)*x - (4*n + 4)*x^2)*v[i - 1] - (x - (2*n + 2)*x^2)*deriv(v[i - 1], x))/(-1 + 2*n*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-8b66c9f49e6d2f0a","steps":["\u03b8+1"],"edges":["e-184005069033f139"],"text":"A331333 \u2192 \u03b8+1"},"headline":"A331333 \u2192 \u03b8+1","chain":null}