{"id":"n-815563081cf14159","revision":0,"first_index":0,"fingerprint":"f6-27be97c9d1c44c83","name":"theta_plus_one of basis_map_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 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"],["2","8"],["6","40","48"],["24","208","432","256"],["120","1232","3408","3584","1280"],["720","8352","27840","39680","25600","6144"],["5040","64224","244992","426240","377600","165888","28672"],["40320","554112","2345280","4716544","5152000","3139584","1003520","131072"],["362880","5309568","24432192","54957056","69950720","52985856","23683072","5767168","589824"],["3628800","55998720","276179328","679875584","974292480","865622016","484098048","165937152","31850496","2621440"],["39916800","645016320","3373964928","8951587840","14116595200","14198446080","9364647936","4038328320","1097072640","170393600","11534336"],["479001600","8059530240","44357677056","125413533696","214157081600","238141009920","178635190272","91269758976","31337349120","6920601600","888143872","50331648"],["6227020800","108605905920","625006983168","1866950215680","3411109729280","4123787120640","3433582186496","2003124879360","818099453952","229244928000","41996517376","4529848320","218103808"],["87178291200","1570298849280","9401733199872","29470673596416","57090287288320","74106346389504","67314490507264","43740124020736","20467454312448","6845426565120","1596628926464","246675406848","22682796032","939524096"],["1307674368000","24251909068800","150447791093760","492202681012224","1003707677306880","1385628574826496","1355546974093312","963825245487104","503842372780032","193647862087680","54069310783488","10667239145472","1409168703488","111803367424","4026531840"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","10","94","920","9624","108336","1312656","17082432","238038336","3540104064","56007504000","939709209600","16672482892800","311960939673600","6140670310656000"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-16"],["0","-8","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","8"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184219,"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-55359ec5b7d3e5c6"]},{"id":184220,"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-55359ec5b7d3e5c6"]},{"id":184221,"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-55359ec5b7d3e5c6"]},{"id":184222,"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-55359ec5b7d3e5c6"]}],"region_exact":{},"incoming_edges":[{"id":"e-55359ec5b7d3e5c6","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-815563081cf14159","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":"62cd452d586fd110e7cb80a5694ed75a81258ca24c9cfa3e9464c5f7eac609de","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-52d9fa43425cb9e1","role":"sequence","name":"basis_map_A013609 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 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:       2,        8;\n  2:       6,       40,        48;\n  3:      24,      208,       432,       256;\n  4:     120,     1232,      3408,      3584,      1280;\n  5:     720,     8352,     27840,     39680,     25600,      6144;\n  6:    5040,    64224,    244992,    426240,    377600,    165888,     28672;\n  7:   40320,   554112,   2345280,   4716544,   5152000,   3139584,   1003520,    131072;\n  8:  362880,  5309568,  24432192,  54957056,  69950720,  52985856,  23683072,   5767168,   589824;\n  9: 3628800, 55998720, 276179328, 679875584, 974292480, 865622016, 484098048, 165937152, 31850496, 2621440;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2+8*n*x+16*x^2)*P(n-2,x) + (2*n+1+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 8*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 8*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 + 8*n*x + 16*x^2)*P[n - 2, x] + (2*n + 1 + 8*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 8*n*x + 16*x^2)*v[i - 2] + (2*n + 1 + 8*x)*v[i - 1]); 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-60c7e36cbe887b7e","steps":["basis A013609","\u03b8+1"],"edges":["e-7070cc8d62757598","e-55359ec5b7d3e5c6"],"text":"A137320 \u2192 basis A013609 \u2192 \u03b8+1"},"headline":"A137320 \u2192 basis A013609 \u2192 \u03b8+1","chain":null}