{"id":"n-bac037884d2391c5","revision":0,"first_index":0,"fingerprint":"f6-dae00e5755e6d397","name":"theta_plus_one of Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.","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","6"],["1","16","21"],["1","34","93","60"],["1","68","288","376","155"],["1","134","774","1528","1265","378"],["1","264","1935","5120","6375","3816","889"],["1","522","4635","15380","25575","22986","10717","2040"],["1","1036","10794","43064","89600","107436","75166","28624","4599"],["1","2062","24636","114800","286790","429996","401212","229216","73665","10230"],["1","4112","55377","295104","860370","1548288","1806042","1375872","663309","184240","22517"],["1","8210","122985","737580","2458050","5161212","7225050","6880560","4423005","1842850","450461","49140"],["1","16404","270468","1802680","6759225","16220952","26492928","30276576","24328755","13515700","4955676","1081224","106483"],["1","32790","589986","4325992","18023775","48662262","90833820","121109472","116782479","81098050","39647586","12975480","2555761","229362"],["1","65560","1278147","10224448","46860385","140578152","295209915","449839104","506065131","421718440","257715601","112457280","33225907","5963608","491505"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","38","188","888","4080","18400","81856","360320","1572608","6815232","29359104","125827072","536866816","2281693184"],"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":[["2","0","0"],["0","2","-1"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["2","16","-6","-8","0"],["0","-2","21","0","-1"],["0","0","-3","9","0"],["0","0","0","-1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","-4","-10","-4","0"],["0","0","3","-1","-5","-1"],["0","0","0","1","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176160,"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-8385b7647634af6e"]},{"id":176161,"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-8385b7647634af6e"]},{"id":176162,"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-8385b7647634af6e"]}],"region_exact":{},"incoming_edges":[{"id":"e-8385b7647634af6e","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-bac037884d2391c5","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":"c62162d148f65b25430c7cc4d63a151f312e94fe2b4ddf7a7762b019cb552264","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-13e23eca5f474574","role":"sequence","name":"Triangle of scaled 1-tiered binomial coefficients, T(n,k) = 2^(n+1)*(n-k,k)_1 (n >= 0, 0 <= k <= n), where (N,M)_1 is the 1-tiered binomial coefficient.","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,    6;\n  2: 1,   16,    21;\n  3: 1,   34,    93,     60;\n  4: 1,   68,   288,    376,    155;\n  5: 1,  134,   774,   1528,   1265,    378;\n  6: 1,  264,  1935,   5120,   6375,   3816,    889;\n  7: 1,  522,  4635,  15380,  25575,  22986,  10717,   2040;\n  8: 1, 1036, 10794,  43064,  89600, 107436,  75166,  28624,  4599;\n  9: 1, 2062, 24636, 114800, 286790, 429996, 401212, 229216, 73665, 10230;\n","recurrence_sentence":"The row polynomials satisfy (2+2*n*x+(n^2-n)*x^2)*P(n,x) = (2-(2*n-16)*x-(3*n^2-21*n+6)*x^2-(n^3-9*n^2+8)*x^3+(n^3-n)*x^4)*P(n-1,x) + (2*x+(3*n-4)*x^2+(n^2-n-10)*x^3-(5*n+4)*x^4-(n^2+n)*x^5)*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[((2 - (2*n - 16)*x - (3*n^2 - 21*n + 6)*x^2 - (n^3 - 9*n^2 + 8)*x^3 + (n^3 - n)*x^4)*P[n - 1, x] + (2*x + (3*n - 4)*x^2 + (n^2 - n - 10)*x^3 - (5*n + 4)*x^4 - (n^2 + n)*x^5)*D[P[n - 1, x], x])/(2 + 2*n*x + (n^2 - n)*x^2)]];\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] = ((2 - (2*n - 16)*x - (3*n^2 - 21*n + 6)*x^2 - (n^3 - 9*n^2 + 8)*x^3 + (n^3 - n)*x^4)*v[i - 1] + (2*x + (3*n - 4)*x^2 + (n^2 - n - 10)*x^3 - (5*n + 4)*x^4 - (n^2 + n)*x^5)*deriv(v[i - 1], x))/(2 + 2*n*x + (n^2 - n)*x^2)); 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-13e23eca5f474574","steps":["\u03b8+1"],"edges":["e-8385b7647634af6e"],"text":"A308737 \u2192 \u03b8+1"},"headline":"A308737 \u2192 \u03b8+1","chain":null}