{"id":"n-a9dd4bd3ae219746","revision":2,"first_index":0,"fingerprint":"f6-8cc5447af65adb41","name":"one_plus_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":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["3","2"],["5","8","2"],["7","22","14","2"],["9","44","54","20","2"],["11","74","146","102","26","2"],["13","112","314","352","166","32","2"],["15","158","582","938","702","246","38","2"],["17","212","974","2092","2250","1236","342","44","2"],["19","274","1514","4110","5922","4650","1994","454","50","2"],["21","344","2226","7352","13486","14184","8634","3016","582","56","2"],["23","422","3134","12242","27526","36958","30046","14794","4342","726","62","2"],["25","508","4262","19268","51602","85276","88494","57956","23818","6012","886","68","2"],["27","602","5634","28982","90410","178770","228706","190862","103866","36490","8066","1062","74","2"]],"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:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","16","-6","-2"],["-3","16","-22","0","1"],["5","-11","5","1","0"],["-2","2","0","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","0","-16","6","2"],["-1","-2","30","-8","-3"],["3","15","-15","-3","0"],["-2","-6","0","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-2","-7","29","11","1"],["0","-1","0","36","12","1","0"],["0","2","12","2","0","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161280,"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-b2a6ce2f982337a1"]},{"id":161281,"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-b2a6ce2f982337a1"]},{"id":161282,"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-b2a6ce2f982337a1"]},{"id":161283,"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-01157a6073b8735e","e-b2a6ce2f982337a1"]},{"id":161284,"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-01157a6073b8735e"]},{"id":161285,"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-01157a6073b8735e"]},{"id":161286,"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-01157a6073b8735e"]}],"region_exact":{},"incoming_edges":[{"id":"e-01157a6073b8735e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-a9dd4bd3ae219746","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":"f404f7c46b48d389cfd4e23d5df0b02d299f43be923d9046a635941bc3665fc7","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-b2a6ce2f982337a1","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-a9dd4bd3ae219746","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":"71b8bb63af5a1c817ba9de08f031161def29dd3b5708070962e6bbefecbf7e4f","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:  1;\n  1:  1;\n  2:  3,   2;\n  3:  5,   8,   2;\n  4:  7,  22,  14,    2;\n  5:  9,  44,  54,   20,    2;\n  6: 11,  74, 146,  102,   26,    2;\n  7: 13, 112, 314,  352,  166,   32,   2;\n  8: 15, 158, 582,  938,  702,  246,  38,  2;\n  9: 17, 212, 974, 2092, 2250, 1236, 342, 44, 2;\n","recurrence_sentence":"The row polynomials satisfy -(2*n^3-5*n^2+3*n-(2*n^3-11*n^2+16*n)*x-(5*n^2-22*n+16)*x^2-(n^2-6)*x^3-(n-2)*x^4)*P(n,x) = -(2*n^3-3*n^2+n+(6*n^3-15*n^2+2*n)*x+(15*n^2-30*n+16)*x^2+(3*n^2+8*n-6)*x^3+(3*n-2)*x^4)*P(n-1,x) + ((2*n^2-n)*x+(12*n^2-2)*x^2+(2*n^2+36*n-7)*x^3+(12*n+29)*x^4+(n+11)*x^5+x^6)*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[(-(2*n^3 - 3*n^2 + n + (6*n^3 - 15*n^2 + 2*n)*x + (15*n^2 - 30*n + 16)*x^2 + (3*n^2 + 8*n - 6)*x^3 + (3*n - 2)*x^4)*P[n - 1, x] + ((2*n^2 - n)*x + (12*n^2 - 2)*x^2 + (2*n^2 + 36*n - 7)*x^3 + (12*n + 29)*x^4 + (n + 11)*x^5 + x^6)*D[P[n - 1, x], x])/(-2*n^3 + 5*n^2 - 3*n + (2*n^3 - 11*n^2 + 16*n)*x + (5*n^2 - 22*n + 16)*x^2 + (n^2 - 6)*x^3 + (n - 2)*x^4)]];\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] = (-(2*n^3 - 3*n^2 + n + (6*n^3 - 15*n^2 + 2*n)*x + (15*n^2 - 30*n + 16)*x^2 + (3*n^2 + 8*n - 6)*x^3 + (3*n - 2)*x^4)*v[i - 1] + ((2*n^2 - n)*x + (12*n^2 - 2)*x^2 + (2*n^2 + 36*n - 7)*x^3 + (12*n + 29)*x^4 + (n + 11)*x^5 + x^6)*deriv(v[i - 1], x))/(-2*n^3 + 5*n^2 - 3*n + (2*n^3 - 11*n^2 + 16*n)*x + (5*n^2 - 22*n + 16)*x^2 + (n^2 - 6)*x^3 + (n - 2)*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-e073e5e0b021f36a","steps":["D+1"],"edges":["e-01157a6073b8735e"],"text":"A035607 \u2192 D+1"},"headline":"A035607 \u2192 D+1","chain":null}