{"id":"n-6dcddf47a4213628","revision":2,"first_index":0,"fingerprint":"f6-bdffa836d0347b9d","name":"derivative 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":"affine","degree_slope":1,"degree_intercept":-2,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[[],[],["2"],["4","4"],["6","16","6"],["8","36","36","8"],["10","64","114","64","10"],["12","100","264","264","100","12"],["14","144","510","768","510","144","14"],["16","196","876","1800","1800","876","196","16"],["18","256","1386","3648","5010","3648","1386","256","18"],["20","324","2064","6664","11820","11820","6664","2064","324","20"],["22","400","2934","11264","24710","32016","24710","11264","2934","400","22"],["24","484","4020","17928","47120","75852","75852","47120","17928","4020","484","24"],["26","576","5346","27200","83610","162048","201698","162048","83610","27200","5346","576","26"]],"degrees":[-1,-1,0,1,2,3,4,5,6,7,8,9,10,11,12],"row_sums":["0","0","2","8","28","88","262","752","2104","5776","15626","41784","110676","290856","759310"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["2","-2"],["-1","1"]]},"terms":[{"coeff":{"coeffs":[["1","9","2"],["-1","-3","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","6","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161273,"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-64d982d75856655e"]},{"id":161274,"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-64d982d75856655e"]},{"id":161275,"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-64d982d75856655e"]},{"id":161276,"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-3ad80f605886667b","e-64d982d75856655e"]},{"id":161277,"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-3ad80f605886667b"]},{"id":161278,"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-3ad80f605886667b"]},{"id":161279,"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-3ad80f605886667b"]}],"region_exact":{},"incoming_edges":[{"id":"e-3ad80f605886667b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-6dcddf47a4213628","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"793bcd6f89631faa1e4fa44f75f3b2240f94cf90b47d5f0cb4eaa6188428bb0a","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]"}]},{"id":"e-64d982d75856655e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-6dcddf47a4213628","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"11fbdb5f05eb807404d6f1154095742fba9851f177a66b02278406cd2f9b3435","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]"}]}],"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:  0;\n  1:  0;\n  2:  2;\n  3:  4,   4;\n  4:  6,  16,   6;\n  5:  8,  36,  36,    8;\n  6: 10,  64, 114,   64,   10;\n  7: 12, 100, 264,  264,  100,  12;\n  8: 14, 144, 510,  768,  510, 144,  14;\n  9: 16, 196, 876, 1800, 1800, 876, 196, 16;\n","recurrence_sentence":"The row polynomials satisfy -(n-2-(n-2)*x)*P(n,x) = -(n-1+(3*n-9)*x-2*x^2)*P(n-1,x) + (x+6*x^2+x^3)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1 + (3*n - 9)*x - 2*x^2)*P[n - 1, x] + (x + 6*x^2 + x^3)*D[P[n - 1, x], x])/(-n + 2 + (n - 2)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 3, N, my(i = n + 1); v[i] = (-(n - 1 + (3*n - 9)*x - 2*x^2)*v[i - 1] + (x + 6*x^2 + x^3)*deriv(v[i - 1], x))/(-n + 2 + (n - 2)*x)); 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-e073e5e0b021f36a","steps":["D"],"edges":["e-3ad80f605886667b"],"text":"A035607 \u2192 D"},"headline":"A035607 \u2192 D","chain":null}