{"id":"n-c10921741d0cb383","revision":0,"first_index":0,"fingerprint":"f6-a71577c760e2f25d","name":"theta_plus_one_squared of basis_map_A007318 of Triangular array formed by the Mersenne 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"],["4","4"],["14","32","9"],["48","176","108","16"],["164","832","810","256","25"],["560","3632","4896","2432","500","36"],["1912","15104","26136","17920","5750","864","49"],["6528","60800","128736","113280","50000","11664","1372","64"],["22288","239104","599472","646144","365500","116928","21266","2048","81"],["76096","923968","2678400","3423744","2371600","970704","241472","35840","2916","100"],["259808","3522048","11593584","17164288","14105000","7064064","2244592","454656","56862","4000","121"],["887040","13279488","48942144","82420480","78496000","46626048","18110400","4678656","797040","86000","5324","144"],["3028544","49622016","202460256","382361600","414556000","285410304","131415648","41459712","8995860","1320000","125114","6912","169"],["10340096","184043264","823606272","1724534784","2098672000","1645349760","877916928","328126464","86861808","16214000","2087008","176256","8788","196"],["35303296","678289408","3303601920","7597604864","10260161600","9032666112","5488340256","2376253440","744740568","169452800","27716744","3174912","241670","10976","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","8","55","348","2087","12056","67735","372444","2012831","10724840","56469023","294328764","1520762135","7797937624","39717558791"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0","0","0"],["512","64","32","0","0"],["0","0","0","0","0"],["0","0","-160","-40","0"],["0","0","0","0","0"],["0","0","0","0","2"]]},"terms":[{"coeff":{"coeffs":[["1024","704","224","16","-8","0"],["1024","1152","192","-120","-44","0"],["0","448","-352","-336","-72","1"],["0","0","-320","-216","-36","3"],["0","0","0","-16","4","3"],["0","0","0","0","4","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["512","768","320","0","-32","-4","0"],["0","0","-448","-608","-216","-20","0"],["0","0","-448","-608","-208","-12","1"],["0","0","0","0","16","16","2"],["0","0","0","0","8","8","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178039,"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-2c2a80fe9ff9b06e"]},{"id":178040,"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-2c2a80fe9ff9b06e"]},{"id":178041,"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-2c2a80fe9ff9b06e"]},{"id":178042,"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-2c2a80fe9ff9b06e"]}],"region_exact":{},"incoming_edges":[{"id":"e-2c2a80fe9ff9b06e","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-c10921741d0cb383","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":"7251e356748357f0e265215009270095ba2f0a791216773201b2eef59c09a084","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-6bdb5d7e28f56300","role":"sequence","name":"basis_map_A007318 of Triangular array formed by the Mersenne 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:     4,      4;\n  2:    14,     32,       9;\n  3:    48,    176,     108,      16;\n  4:   164,    832,     810,     256,      25;\n  5:   560,   3632,    4896,    2432,     500,     36;\n  6:  1912,  15104,   26136,   17920,    5750,    864,     49;\n  7:  6528,  60800,  128736,  113280,   50000,  11664,   1372,    64;\n  8: 22288, 239104,  599472,  646144,  365500, 116928,  21266,  2048,   81;\n  9: 76096, 923968, 2678400, 3423744, 2371600, 970704, 241472, 35840, 2916, 100;\n","recurrence_sentence":"The row polynomials satisfy (512*n+64*n*x-(160*n^3-32*n)*x^2-40*n^3*x^3+2*n^5*x^4)*P(n,x) = (1024*n+1024+(448*n^2+1152*n+704)*x-(320*n^3+352*n^2-192*n-224)*x^2-(16*n^4+216*n^3+336*n^2+120*n-16)*x^3+(4*n^5+4*n^4-36*n^3-72*n^2-44*n-8)*x^4+(n^5+3*n^4+3*n^3+n^2)*x^5)*P(n-1,x) + (512+768*x-(448*n^2+448*n-320)*x^2-(608*n^2+608*n)*x^3+(8*n^4+16*n^3-208*n^2-216*n-32)*x^4+(8*n^4+16*n^3-12*n^2-20*n-4)*x^5+(n^4+2*n^3+n^2)*x^6)*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[((1024*n + 1024 + (448*n^2 + 1152*n + 704)*x - (320*n^3 + 352*n^2 - 192*n - 224)*x^2 - (16*n^4 + 216*n^3 + 336*n^2 + 120*n - 16)*x^3 + (4*n^5 + 4*n^4 - 36*n^3 - 72*n^2 - 44*n - 8)*x^4 + (n^5 + 3*n^4 + 3*n^3 + n^2)*x^5)*P[n - 1, x] + (512 + 768*x - (448*n^2 + 448*n - 320)*x^2 - (608*n^2 + 608*n)*x^3 + (8*n^4 + 16*n^3 - 208*n^2 - 216*n - 32)*x^4 + (8*n^4 + 16*n^3 - 12*n^2 - 20*n - 4)*x^5 + (n^4 + 2*n^3 + n^2)*x^6)*D[P[n - 1, x], x])/(512*n + 64*n*x - (160*n^3 - 32*n)*x^2 - 40*n^3*x^3 + 2*n^5*x^4)]];\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] = ((1024*n + 1024 + (448*n^2 + 1152*n + 704)*x - (320*n^3 + 352*n^2 - 192*n - 224)*x^2 - (16*n^4 + 216*n^3 + 336*n^2 + 120*n - 16)*x^3 + (4*n^5 + 4*n^4 - 36*n^3 - 72*n^2 - 44*n - 8)*x^4 + (n^5 + 3*n^4 + 3*n^3 + n^2)*x^5)*v[i - 1] + (512 + 768*x - (448*n^2 + 448*n - 320)*x^2 - (608*n^2 + 608*n)*x^3 + (8*n^4 + 16*n^3 - 208*n^2 - 216*n - 32)*x^4 + (8*n^4 + 16*n^3 - 12*n^2 - 20*n - 4)*x^5 + (n^4 + 2*n^3 + n^2)*x^6)*deriv(v[i - 1], x))/(512*n + 64*n*x - (160*n^3 - 32*n)*x^2 - 40*n^3*x^3 + 2*n^5*x^4)); 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-9b5c7e97e5191da6","steps":["basis A007318","(\u03b8+1)\u00b2"],"edges":["e-1d7f8f614531604f","e-2c2a80fe9ff9b06e"],"text":"A110441 \u2192 basis A007318 \u2192 (\u03b8+1)\u00b2"},"headline":"A110441 \u2192 basis A007318 \u2192 (\u03b8+1)\u00b2","chain":null}
