{"id":"n-d6c33c44f3c36245","revision":0,"first_index":0,"fingerprint":"f6-96a3b8d1e1453386","name":"shift_x_plus_one of basis_map_A013611 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"],["11","8"],["71","96","32"],["481","944","608","128"],["3241","8352","7968","3328","512"],["21851","69720","88032","54912","16896","2048"],["147311","560448","880320","730112","336896","81920","8192"],["993121","4387936","8242752","8528640","5245952","1916928","385024","32768"],["6695281","33691584","73651648","91314688","70195200","34242560","10346496","1769472","131072"],["45137291","254842792","635441728","918108928","846774272","516804608","208642048","53706752","7995392","524288"],["304300151","1904844960","5335046112","8801600512","9469316096","6939918336","3507773440","1207042048","270532608","35651584","2097152"],["2051487361","14101033488","43826236320","81282099072","99928605696","85487894528","51916742656","22376448000","6706167808","1330642944","157286400","8388608"],["13830424921","103553575776","353656162272","728345726720","1007253012992","985218646016","698750574592","361991962624","135923630080","36068917248","6419382272","687865856","33554432"],["93239986331","755354271224","2811686592288","6366414450048","9781672409600","10767477823488","8734913323008","5286503284736","2386546262016","793585909760","188900966400","30475812864","2986344448","134217728"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","19","199","2161","23401","253459","2745199","29733121","322038001","3487978099","37778122999","409173032881","4431733435801","47999891653939"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"],["11","8"]],"recurrence":{"denominator":{"coeffs":[["-4"],["2"]]},"terms":[{"coeff":{"coeffs":[["4"],["-10"],["4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["88","110","32"],["-28","-32","-8"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["35","68","42","8"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180443,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-983d379356fefbe3"]},{"id":180444,"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-983d379356fefbe3"]},{"id":180445,"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-983d379356fefbe3"]}],"region_exact":{},"incoming_edges":[{"id":"e-983d379356fefbe3","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-d6c33c44f3c36245","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"5102cfb5a0ce1f8b7b14b2084b74a669328ab0a751e7a05da61b3753a0c8f1ee","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-f91986a1e2f81fd1","role":"sequence","name":"basis_map_A013611 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.","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":[{"id":"l-057af6f1cb514a54","kind":"candidate_equal","node_a_id":"n-d6c33c44f3c36245","node_b_id":"n-c247d6abed34f3f9","fingerprint":null,"oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"reason":"no all-index equality certificate was found","rows_compared":15},"other_id":"n-c247d6abed34f3f9","other":{"id":"n-c247d6abed34f3f9","name":"basis_map_A007318 of basis_map_A013611 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.","first_index":0,"fingerprint":"f6-96a3b8d1e1453386","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["11","8"]],"card_rows":[["1"],["1"],["11","8"],["71","96","32"]],"row_sums_preview":["1","1","19","199","2161","23401","253459","2745199"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e073e5e0b021f36a","steps":["basis A013611","basis A007318"],"edges":["e-8337e61ed504a271","e-8ddabb6b6347c4f5"],"text":"A035607 \u2192 basis A013611 \u2192 basis A007318"},"headline":"A035607 \u2192 basis A013611 \u2192 basis A007318","chain":null}}],"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:      11,        8;\n  3:      71,       96,       32;\n  4:     481,      944,      608,      128;\n  5:    3241,     8352,     7968,     3328,      512;\n  6:   21851,    69720,    88032,    54912,    16896,     2048;\n  7:  147311,   560448,   880320,   730112,   336896,    81920,     8192;\n  8:  993121,  4387936,  8242752,  8528640,  5245952,  1916928,   385024,   32768;\n  9: 6695281, 33691584, 73651648, 91314688, 70195200, 34242560, 10346496, 1769472, 131072;\n","recurrence_sentence":"The row polynomials satisfy (2*n-4)*P(n,x) = (4*n^2-10*n+4)*P(n-1,x) - (28*n-88+(32*n-110)*x+(8*n-32)*x^2)*d/dx P(n-1,x) + (35+68*x+42*x^2+8*x^3)*d^2/dx^2 P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1, P(2,x) = 11 + 8*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[2, x_] := 11 + 8*x;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 10*n + 4)*P[n - 1, x] - (28*n - 88 + (32*n - 110)*x + (8*n - 32)*x^2)*D[P[n - 1, x], x] + (35 + 68*x + 42*x^2 + 8*x^3)*D[P[n - 1, x], {x, 2}])/(2*n - 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; v[3] = 11 + 8*x; for(n = 3, N, my(i = n + 1); v[i] = ((4*n^2 - 10*n + 4)*v[i - 1] - (28*n - 88 + (32*n - 110)*x + (8*n - 32)*x^2)*deriv(v[i - 1], x) + (35 + 68*x + 42*x^2 + 8*x^3)*deriv(deriv(v[i - 1], x), x))/(2*n - 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":["basis A013611","x \u21a6 x+1"],"edges":["e-8337e61ed504a271","e-983d379356fefbe3"],"text":"A035607 \u2192 basis A013611 \u2192 x \u21a6 x+1"},"headline":"A035607 \u2192 basis A013611 \u2192 x \u21a6 x+1","chain":null}