{"id":"n-9a641acc1d377232","revision":0,"first_index":1,"fingerprint":"f6-9c3ef9fd36e933df","name":"theta_plus_one of basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","2"],["2","8","3"],["3","26","24","4"],["5","78","132","52","5"],["8","224","624","432","95","6"],["13","630","2721","2944","1105","156","7"],["21","1750","11316","17964","10220","2412","238","8"],["34","4828","45681","102348","82760","28998","4711","344","9"],["55","13266","180858","557244","615290","300036","71288","8472","477","10"],["89","36366","706758","2940420","4314740","2811864","915866","157384","14292","640","11"],["144","99552","2737296","15174144","29022230","24587436","10540628","2455024","319509","22910","836","12"],["233","272302","10536039","77050328","189328055","204400164","112161308","33992400","5943168","606390","35222","1068","13"],["377","744462","40377786","386595668","1207032015","1635945942","1126065752","431810176","97367445","13251530","1088868","52296","1339","14"],["610","2034748","154266621","1922469084","7561357845","12717708720","10814659877","5141537248","1453823415","253368770","27608702","1866648","75387","1652","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","13","57","272","1389","7576","43929","269713","1746996","11898430","84959721","634326690","4940333670","40050779342"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1","2"],["2","8","3"],["3","26","24","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","0","-2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","0","-2"]]},"deriv_order":1,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["1","2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176245,"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-263f86ef1e843db6"]},{"id":176246,"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-263f86ef1e843db6"]},{"id":176247,"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-263f86ef1e843db6"]}],"region_exact":{},"incoming_edges":[{"id":"e-263f86ef1e843db6","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-9a641acc1d377232","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":"4407d68b96f304669800162de892861a10187694afa45cd840d162af60738ad7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-45d3b6c39c71e61d","role":"sequence","name":"basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","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":[],"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,     2;\n   3:  2,     8,      3;\n   4:  3,    26,     24,      4;\n   5:  5,    78,    132,     52,      5;\n   6:  8,   224,    624,    432,     95,      6;\n   7: 13,   630,   2721,   2944,   1105,    156,     7;\n   8: 21,  1750,  11316,  17964,  10220,   2412,   238,    8;\n   9: 34,  4828,  45681, 102348,  82760,  28998,  4711,  344,   9;\n  10: 55, 13266, 180858, 557244, 615290, 300036, 71288, 8472, 477, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -x^2*P(n-4,x) - x^2*d/dx P(n-4,x) - 2*x^2*P(n-3,x) - 2*x^2*d/dx P(n-3,x) + (1+2*x-x^2)*P(n-2,x) + (x-x^2)*d/dx P(n-2,x) + (1+2*x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 1 + 2*x, P(3,x) = 2 + 8*x + 3*x^2, P(4,x) = 3 + 26*x + 24*x^2 + 4*x^3.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + 2*x;\nP[3, x_] := 2 + 8*x + 3*x^2;\nP[4, x_] := 3 + 26*x + 24*x^2 + 4*x^3;\nP[n_, x_] := P[n, x] = Expand[-x^2*P[n - 4, x] - x^2*D[P[n - 4, x], x] - 2*x^2*P[n - 3, x] - 2*x^2*D[P[n - 3, x], x] + (1 + 2*x - x^2)*P[n - 2, x] + (x - x^2)*D[P[n - 2, x], x] + (1 + 2*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; v[3] = 2 + 8*x + 3*x^2; v[4] = 3 + 26*x + 24*x^2 + 4*x^3; for(n = 5, N, my(i = n); v[i] = -x^2*v[i - 4] - x^2*deriv(v[i - 4], x) - 2*x^2*v[i - 3] - 2*x^2*deriv(v[i - 3], x) + (1 + 2*x - x^2)*v[i - 2] + (x - x^2)*deriv(v[i - 2], x) + (1 + 2*x)*v[i - 1] + x*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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-392f49b496f79fbf","steps":["basis A008277","\u03b8+1"],"edges":["e-08527b1121a7be71","e-263f86ef1e843db6"],"text":"A026729 \u2192 basis A008277 \u2192 \u03b8+1"},"headline":"A026729 \u2192 basis A008277 \u2192 \u03b8+1","chain":null}