{"id":"n-ffd64b15cb7f95af","revision":1,"first_index":1,"fingerprint":"f6-b5575767b5ed4a03","name":"theta_plus_one_squared of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).","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"],["2","4"],["3","16","9"],["4","40","54","16"],["5","80","189","128","25"],["6","140","504","576","250","36"],["7","224","1134","1920","1375","432","49"],["8","336","2268","5280","5500","2808","686","64"],["9","480","4158","12672","17875","13104","5145","1024","81"],["10","660","7128","27456","50050","49140","27440","8704","1458","100"],["11","880","11583","54912","125125","157248","116620","52224","13851","2000","121"],["12","1144","18018","102960","286000","445536","419832","248064","92340","21000","2662","144"],["13","1456","27027","183040","607750","1145664","1329468","992256","484785","154000","30613","3456","169"],["14","1820","39312","311168","1215500","2720952","3798480","3472896","2133054","885500","244904","43200","4394","196"],["15","2240","55692","509184","2309450","6046560","9971010","10914816","8176707","4250400","1530650","374400","59319","5488","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","28","114","427","1512","5141","16950","54548","172146","534575","1637712","4959697","14871390","44206156"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-8","20","-2"],["8","-60","10"],["0","60","-20"],["0","-20","20"],["0","0","-10"],["0","0","2"]]},"terms":[{"coeff":{"coeffs":[["0","0","0","0"],["8","-4","-2","0"],["0","40","10","0"],["0","-20","-6","1"],["0","0","-8","-2"],["0","0","2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","16","-4","-2","0"],["0","0","40","10","0"],["0","0","-40","-6","1"],["0","0","0","-8","-2"],["0","0","0","4","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163593,"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-67a2e8580e66d57b"]},{"id":163594,"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-67a2e8580e66d57b"]},{"id":163595,"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-67a2e8580e66d57b"]},{"id":163596,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-67a2e8580e66d57b"]}],"region_exact":{},"incoming_edges":[{"id":"e-67a2e8580e66d57b","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-ffd64b15cb7f95af","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":"1c83f06193da1ab7d5e66a1bf2d266e66a76b4fea09c262b8d853aa8fdda3dce","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-976cdb6e4a693ec8","role":"sequence","name":"Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).","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:  2,   4;\n   3:  3,  16,    9;\n   4:  4,  40,   54,    16;\n   5:  5,  80,  189,   128,    25;\n   6:  6, 140,  504,   576,   250,    36;\n   7:  7, 224, 1134,  1920,  1375,   432,    49;\n   8:  8, 336, 2268,  5280,  5500,  2808,   686,   64;\n   9:  9, 480, 4158, 12672, 17875, 13104,  5145, 1024,   81;\n  10: 10, 660, 7128, 27456, 50050, 49140, 27440, 8704, 1458, 100;\n","recurrence_sentence":"The row polynomials satisfy (8*n-8-(20*n^3-60*n^2+60*n-20)*x+(2*n^5-10*n^4+20*n^3-20*n^2+10*n-2)*x^2)*P(n,x) = (8*n-(20*n^3-40*n^2+4*n)*x+(2*n^5-8*n^4-6*n^3+10*n^2-2*n)*x^2+(n^5-2*n^4+n^3)*x^3)*P(n-1,x) + (16*x-(40*n^2-40*n+4)*x^2+(4*n^4-8*n^3-6*n^2+10*n-2)*x^3+(n^4-2*n^3+n^2)*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((8*n - (20*n^3 - 40*n^2 + 4*n)*x + (2*n^5 - 8*n^4 - 6*n^3 + 10*n^2 - 2*n)*x^2 + (n^5 - 2*n^4 + n^3)*x^3)*P[n - 1, x] + (16*x - (40*n^2 - 40*n + 4)*x^2 + (4*n^4 - 8*n^3 - 6*n^2 + 10*n - 2)*x^3 + (n^4 - 2*n^3 + n^2)*x^4)*D[P[n - 1, x], x])/(8*n - 8 - (20*n^3 - 60*n^2 + 60*n - 20)*x + (2*n^5 - 10*n^4 + 20*n^3 - 20*n^2 + 10*n - 2)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((8*n - (20*n^3 - 40*n^2 + 4*n)*x + (2*n^5 - 8*n^4 - 6*n^3 + 10*n^2 - 2*n)*x^2 + (n^5 - 2*n^4 + n^3)*x^3)*v[i - 1] + (16*x - (40*n^2 - 40*n + 4)*x^2 + (4*n^4 - 8*n^3 - 6*n^2 + 10*n - 2)*x^3 + (n^4 - 2*n^3 + n^2)*x^4)*deriv(v[i - 1], x))/(8*n - 8 - (20*n^3 - 60*n^2 + 60*n - 20)*x + (2*n^5 - 10*n^4 + 20*n^3 - 20*n^2 + 10*n - 2)*x^2)); 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-976cdb6e4a693ec8","steps":["(\u03b8+1)\u00b2"],"edges":["e-67a2e8580e66d57b"],"text":"A078812 \u2192 (\u03b8+1)\u00b2"},"headline":"A078812 \u2192 (\u03b8+1)\u00b2","chain":null}