{"id":"n-94c5677ff5a75240","revision":2,"first_index":0,"fingerprint":"f6-cedb3b99895f1c1f","name":"theta_plus_one 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","4"],["1","8","6"],["1","12","24","8"],["1","16","54","48","10"],["1","20","96","152","80","12"],["1","24","150","352","330","120","14"],["1","28","216","680","960","612","168","16"],["1","32","294","1168","2250","2160","1022","224","18"],["1","36","384","1848","4560","6012","4256","1584","288","20"],["1","40","486","2752","8330","14184","13790","7616","2322","360","22"],["1","44","600","3912","14080","29652","37352","28240","12672","3260","440","24"],["1","48","726","5360","22410","56544","88494","86688","53010","19920","4422","528","26"],["1","52","864","7128","34000","100332","189056","230512","182304","92900","29920","5832","624","28"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","5","15","45","129","361","991","2681","7169","18989","49903","130277","338177","873553"],"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":[["0","-4","-6","2"],["-1","-1","-3","-3"],["-1","1","-1","1"],["0","-2","2","0"]]},"terms":[{"coeff":{"coeffs":[["0","4","6","-2"],["-1","-1","-1","3"],["-1","-7","-7","-1"],["0","-2","-6","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","9","19","3","0"],["0","1","10","26","10","1"],["0","0","2","12","2","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161287,"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-1b28fe7d21cc4e12"]},{"id":161288,"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-1b28fe7d21cc4e12"]},{"id":161289,"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-1b28fe7d21cc4e12"]},{"id":161290,"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-1b28fe7d21cc4e12","e-46d00cd0dd655b47"]},{"id":161291,"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-46d00cd0dd655b47"]},{"id":161292,"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-46d00cd0dd655b47"]},{"id":161293,"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-46d00cd0dd655b47"]}],"region_exact":{},"incoming_edges":[{"id":"e-1b28fe7d21cc4e12","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-94c5677ff5a75240","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":"5b35988ace48b5a4fa277eab7de3aabf06f156f17f974b488847547151dfcd28","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-46d00cd0dd655b47","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-94c5677ff5a75240","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":"68b449252a024483b6ec5144c4a92cac036032f486b9f5c5f94982c9583123ba","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,  4;\n  3: 1,  8,   6;\n  4: 1, 12,  24,    8;\n  5: 1, 16,  54,   48,   10;\n  6: 1, 20,  96,  152,   80,   12;\n  7: 1, 24, 150,  352,  330,  120,   14;\n  8: 1, 28, 216,  680,  960,  612,  168,  16;\n  9: 1, 32, 294, 1168, 2250, 2160, 1022, 224, 18;\n","recurrence_sentence":"The row polynomials satisfy -(n^2+n+(2*n^3-n^2+n+4)*x-(2*n^3-n^2-3*n-6)*x^2-(n^2-3*n+2)*x^3)*P(n,x) = -(n^2+n+(2*n^3+7*n^2+n-4)*x+(6*n^3+7*n^2+n-6)*x^2+(n^2-3*n+2)*x^3)*P(n-1,x) + ((n+1)*x+(2*n^2+10*n+9)*x^2+(12*n^2+26*n+19)*x^3+(2*n^2+10*n+3)*x^4+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[(-(n^2 + n + (2*n^3 + 7*n^2 + n - 4)*x + (6*n^3 + 7*n^2 + n - 6)*x^2 + (n^2 - 3*n + 2)*x^3)*P[n - 1, x] + ((n + 1)*x + (2*n^2 + 10*n + 9)*x^2 + (12*n^2 + 26*n + 19)*x^3 + (2*n^2 + 10*n + 3)*x^4 + n*x^5)*D[P[n - 1, x], x])/(-n^2 - n - (2*n^3 - n^2 + n + 4)*x + (2*n^3 - n^2 - 3*n - 6)*x^2 + (n^2 - 3*n + 2)*x^3)]];\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] = (-(n^2 + n + (2*n^3 + 7*n^2 + n - 4)*x + (6*n^3 + 7*n^2 + n - 6)*x^2 + (n^2 - 3*n + 2)*x^3)*v[i - 1] + ((n + 1)*x + (2*n^2 + 10*n + 9)*x^2 + (12*n^2 + 26*n + 19)*x^3 + (2*n^2 + 10*n + 3)*x^4 + n*x^5)*deriv(v[i - 1], x))/(-n^2 - n - (2*n^3 - n^2 + n + 4)*x + (2*n^3 - n^2 - 3*n - 6)*x^2 + (n^2 - 3*n + 2)*x^3)); 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"],"edges":["e-1b28fe7d21cc4e12"],"text":"A266213 \u2192 \u03b8+1"},"headline":"A266213 \u2192 \u03b8+1","chain":null}