{"id":"n-503c0dffb994dc57","revision":2,"first_index":0,"fingerprint":"f6-7f8284a1431ded6a","name":"theta_plus_one_squared of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","8"],["1","16","18"],["1","24","72","32"],["1","32","162","192","50"],["1","40","288","608","400","72"],["1","48","450","1408","1650","720","98"],["1","56","648","2720","4800","3672","1176","128"],["1","64","882","4672","11250","12960","7154","1792","162"],["1","72","1152","7392","22800","36072","29792","12672","2592","200"],["1","80","1458","11008","41650","85104","96530","60928","20898","3600","242"],["1","88","1800","15648","70400","177912","261464","225920","114048","32600","4840","288"],["1","96","2178","21440","112050","339264","619458","693504","477090","199200","48642","6336","338"],["1","104","2592","28512","170000","601992","1323392","1844096","1640736","929000","329120","69984","8112","392"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","9","35","129","437","1409","4375","13201","38937","112745","321499","905009","2519597","6948033"],"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"],["1"]],"recurrence":{"denominator":{"coeffs":[["0","1","-5","-5","1"],["0","0","4","-2","-2"],["1","-4","4","2","1"],["0","6","0","2","0"],["0","0","4","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","1","3","7","-3","0"],["0","2","10","28","8","0"],["0","1","14","28","8","1"],["0","0","6","16","2","0"],["0","0","0","4","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","8","12","-4","0"],["0","-2","10","30","10","0"],["1","3","4","24","7","1"],["0","6","14","10","2","0"],["0","0","4","4","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161294,"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-5c34cb2e6d8d80e7"]},{"id":161295,"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-5c34cb2e6d8d80e7"]},{"id":161296,"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-5c34cb2e6d8d80e7"]},{"id":161297,"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-5c34cb2e6d8d80e7","e-dcf5be93843f2cf7"]},{"id":161298,"position":4,"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-dcf5be93843f2cf7"]},{"id":161299,"position":5,"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-dcf5be93843f2cf7"]},{"id":161300,"position":6,"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-dcf5be93843f2cf7"]}],"region_exact":{},"incoming_edges":[{"id":"e-5c34cb2e6d8d80e7","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-503c0dffb994dc57","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":"f35e0125974f8997846d1b5cad8c7d9e75ac6b79ea416f621e6b394041df9d04","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-a1540a6d32c29f8f","role":"sequence","name":"Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","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]"}]},{"id":"e-dcf5be93843f2cf7","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-503c0dffb994dc57","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":"7ecffc3b92a59144561a2c097d12abe986e0a51de99794e5ea537b04609bfbc4","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-e073e5e0b021f36a","role":"sequence","name":"Table a(d,m) of number of points of L1 norm m in cubic lattice Z^d, read by antidiagonals (d >= 1, m >= 0).","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":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;\n  2: 1,  8;\n  3: 1, 16,  18;\n  4: 1, 24,  72,   32;\n  5: 1, 32, 162,  192,    50;\n  6: 1, 40, 288,  608,   400,    72;\n  7: 1, 48, 450, 1408,  1650,   720,   98;\n  8: 1, 56, 648, 2720,  4800,  3672, 1176,  128;\n  9: 1, 64, 882, 4672, 11250, 12960, 7154, 1792, 162;\n","recurrence_sentence":"The row polynomials satisfy (n^2+(6*n^3-4*n^2+1)*x+(4*n^4+4*n^2+4*n-5)*x^2+(2*n^3+2*n^2-2*n-5)*x^3+(n^2-2*n+1)*x^4)*P(n,x) = ((n^2+2*n+1)*x+(6*n^3+14*n^2+10*n+3)*x^2+(4*n^4+16*n^3+28*n^2+28*n+7)*x^3+(2*n^3+8*n^2+8*n-3)*x^4+n^2*x^5)*P(n-2,x) + (n^2+(6*n^3+3*n^2-2*n)*x+(4*n^4+14*n^3+4*n^2+10*n+8)*x^2+(4*n^4+10*n^3+24*n^2+30*n+12)*x^3+(2*n^3+7*n^2+10*n-4)*x^4+n^2*x^5)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(((n^2 + 2*n + 1)*x + (6*n^3 + 14*n^2 + 10*n + 3)*x^2 + (4*n^4 + 16*n^3 + 28*n^2 + 28*n + 7)*x^3 + (2*n^3 + 8*n^2 + 8*n - 3)*x^4 + n^2*x^5)*P[n - 2, x] + (n^2 + (6*n^3 + 3*n^2 - 2*n)*x + (4*n^4 + 14*n^3 + 4*n^2 + 10*n + 8)*x^2 + (4*n^4 + 10*n^3 + 24*n^2 + 30*n + 12)*x^3 + (2*n^3 + 7*n^2 + 10*n - 4)*x^4 + n^2*x^5)*P[n - 1, x])/(n^2 + (6*n^3 - 4*n^2 + 1)*x + (4*n^4 + 4*n^2 + 4*n - 5)*x^2 + (2*n^3 + 2*n^2 - 2*n - 5)*x^3 + (n^2 - 2*n + 1)*x^4)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (((n^2 + 2*n + 1)*x + (6*n^3 + 14*n^2 + 10*n + 3)*x^2 + (4*n^4 + 16*n^3 + 28*n^2 + 28*n + 7)*x^3 + (2*n^3 + 8*n^2 + 8*n - 3)*x^4 + n^2*x^5)*v[i - 2] + (n^2 + (6*n^3 + 3*n^2 - 2*n)*x + (4*n^4 + 14*n^3 + 4*n^2 + 10*n + 8)*x^2 + (4*n^4 + 10*n^3 + 24*n^2 + 30*n + 12)*x^3 + (2*n^3 + 7*n^2 + 10*n - 4)*x^4 + n^2*x^5)*v[i - 1])/(n^2 + (6*n^3 - 4*n^2 + 1)*x + (4*n^4 + 4*n^2 + 4*n - 5)*x^2 + (2*n^3 + 2*n^2 - 2*n - 5)*x^3 + (n^2 - 2*n + 1)*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-a1540a6d32c29f8f","steps":["(\u03b8+1)\u00b2"],"edges":["e-5c34cb2e6d8d80e7"],"text":"A266213 \u2192 (\u03b8+1)\u00b2"},"headline":"A266213 \u2192 (\u03b8+1)\u00b2","chain":null}