{"id":"n-be0a436924532fa1","revision":0,"first_index":1,"fingerprint":"f6-0cc1bffa76d861e0","name":"theta_plus_one_squared of theta_plus_one 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"],["0","8"],["0","8","27"],["0","0","54","64"],["0","0","27","192","125"],["0","0","0","192","500","216"],["0","0","0","64","750","1080","343"],["0","0","0","0","500","2160","2058","512"],["0","0","0","0","125","2160","5145","3584","729"],["0","0","0","0","0","1080","6860","10752","5832","1000"],["0","0","0","0","0","216","5145","17920","20412","9000","1331"],["0","0","0","0","0","0","2058","17920","40824","36000","13310","1728"],["0","0","0","0","0","0","343","10752","51030","84000","59895","19008","2197"],["0","0","0","0","0","0","0","3584","40824","126000","159720","95040","26364","2744"],["0","0","0","0","0","0","0","512","20412","126000","279510","285120","145002","35672","3375"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","8","35","118","344","908","2237","5230","11743","25524","54024","111840","227225","454276","895603"],"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":[["0","-2","-1"],["0","-4","3"],["-1","9","-3"],["-1","0","1"],["1","-3","0"],["1","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","4","2","0"],["0","10","-9","0"],["4","-2","-18","2"],["6","14","-11","0"],["0","10","0","0"],["-2","0","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","-4","-1","0"],["0","4","-23","-2","1"],["0","8","-10","-3","0"],["0","4","1","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":171574,"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-a544d30fd2549709"]},{"id":171575,"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-a544d30fd2549709"]},{"id":171576,"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-a544d30fd2549709"]}],"region_exact":{},"incoming_edges":[{"id":"e-a544d30fd2549709","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-be0a436924532fa1","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":"d6fbfe992ac1c2ff9156774c287277e255c76415110a6780f2e696bd2a8c7b4e","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-7697b772cd7a5e3f","role":"sequence","name":"theta_plus_one 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: 0, 8;\n   3: 0, 8, 27;\n   4: 0, 0, 54,  64;\n   5: 0, 0, 27, 192, 125;\n   6: 0, 0,  0, 192, 500,  216;\n   7: 0, 0,  0,  64, 750, 1080,  343;\n   8: 0, 0,  0,   0, 500, 2160, 2058,   512;\n   9: 0, 0,  0,   0, 125, 2160, 5145,  3584,  729;\n  10: 0, 0,  0,   0,   0, 1080, 6860, 10752, 5832, 1000;\n","recurrence_sentence":"The row polynomials satisfy (n^5+n^4-n^3-n^2-(3*n^4-9*n^2+4*n+2)*x+(n^3-3*n^2+3*n-1)*x^2)*P(n,x) = -(2*n^5-6*n^3-4*n^2-(10*n^4+14*n^3-2*n^2+10*n+4)*x+(11*n^3+18*n^2+9*n-2)*x^2-2*n^2*x^3)*P(n-1,x) + ((4*n^4+8*n^3+4*n^2)*x+(n^4-10*n^3-23*n^2-4*n)*x^2-(3*n^3+2*n^2+n)*x^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[(-(2*n^5 - 6*n^3 - 4*n^2 - (10*n^4 + 14*n^3 - 2*n^2 + 10*n + 4)*x + (11*n^3 + 18*n^2 + 9*n - 2)*x^2 - 2*n^2*x^3)*P[n - 1, x] + ((4*n^4 + 8*n^3 + 4*n^2)*x + (n^4 - 10*n^3 - 23*n^2 - 4*n)*x^2 - (3*n^3 + 2*n^2 + n)*x^3 + n^2*x^4)*D[P[n - 1, x], x])/(n^5 + n^4 - n^3 - n^2 - (3*n^4 - 9*n^2 + 4*n + 2)*x + (n^3 - 3*n^2 + 3*n - 1)*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] = (-(2*n^5 - 6*n^3 - 4*n^2 - (10*n^4 + 14*n^3 - 2*n^2 + 10*n + 4)*x + (11*n^3 + 18*n^2 + 9*n - 2)*x^2 - 2*n^2*x^3)*v[i - 1] + ((4*n^4 + 8*n^3 + 4*n^2)*x + (n^4 - 10*n^3 - 23*n^2 - 4*n)*x^2 - (3*n^3 + 2*n^2 + n)*x^3 + n^2*x^4)*deriv(v[i - 1], x))/(n^5 + n^4 - n^3 - n^2 - (3*n^4 - 9*n^2 + 4*n + 2)*x + (n^3 - 3*n^2 + 3*n - 1)*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-392f49b496f79fbf","steps":["\u03b8+1","(\u03b8+1)\u00b2"],"edges":["e-cd00da36b6a89aa7","e-a544d30fd2549709"],"text":"A026729 \u2192 \u03b8+1 \u2192 (\u03b8+1)\u00b2"},"headline":"A026729 \u2192 \u03b8+1 \u2192 (\u03b8+1)\u00b2","chain":null}