{"id":"n-67db2effba549c79","revision":2,"first_index":0,"fingerprint":"f6-765e1f4dee9a440f","name":"basis_map_A007318 of Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,0,-1,0,0,0,0,0,0,...] DELTA [3,-2,-1,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["4","3"],["8","10","3"],["32","64","42","9"],["64","160","148","60","9"],["256","832","1072","684","216","27"],["512","1920","2976","2440","1116","270","27"],["2048","9216","17664","18688","11784","4428","918","81"],["4096","20480","44544","55040","42256","20640","6264","1080","81"],["16384","94208","239616","353792","334144","209328","86976","23112","3564","243"],["32768","204800","573440","947200","1022080","752800","383280","133200","30240","4050","243"],["131072","917504","2908160","5509120","6929920","6077440","3791520","1682640","520560","106920","13122","729"],["262144","1966080","6733824","13926400","19368960","19084800","13660480","7156800","2723760","734400","133164","14580","729"],["1048576","8650752","32833536","75907072","119255040","134446080","111896320","69608640","32365440","11108880","2735856","457812","46656","2187"],["2097152","18350080","74317824","184647680","314417152","388147200","358238720","251113600","134339520","54583200","16580592","3651480","551124","51030","2187"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","21","147","441","3087","9261","64827","194481","1361367","4084101","28588707","85766121","600362847","1801088541"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["4","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["8","10","3"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":"e-9288cdb19cf0727b","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-6","-13","-6"],["10","16","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-16","-36","-26","-6"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161548,"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-56752775b3d97dc0"]},{"id":161549,"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-1c523c2967bf00ac","e-56752775b3d97dc0"]},{"id":161550,"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-1c523c2967bf00ac","e-56752775b3d97dc0"]},{"id":161551,"position":3,"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-1c523c2967bf00ac"]}],"region_exact":{},"incoming_edges":[{"id":"e-56752775b3d97dc0","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-67db2effba549c79","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"665b82d57e53ad444f72a8bb27c6691f812713fbdb0b588f2c110612c3ce9464","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-7196be931c2ed996","role":"sequence","name":"Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,0,-1,0,0,0,0,0,0,...] DELTA [3,-2,-1,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.","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-9288cdb19cf0727b","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-67db2effba549c79","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"9e96ab175d2a3caa9fd8bca780a38d87c3c9302f03c55a52f7620e29caf39b2f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-1c523c2967bf00ac","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-67db2effba549c79","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":"1ac5167e9d03597f1149c3a7d867f729314662ed740c9191c2bbe1adcb1ec5bb","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-7196be931c2ed996","role":"sequence","name":"Triangle T(n,k), 0 <= k <= n, read by rows, given by [1,0,-1,0,0,0,0,0,0,...] DELTA [3,-2,-1,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.","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:     4,     3;\n  2:     8,    10,      3;\n  3:    32,    64,     42,      9;\n  4:    64,   160,    148,     60,      9;\n  5:   256,   832,   1072,    684,    216,     27;\n  6:   512,  1920,   2976,   2440,   1116,    270,    27;\n  7:  2048,  9216,  17664,  18688,  11784,   4428,   918,    81;\n  8:  4096, 20480,  44544,  55040,  42256,  20640,  6264,  1080,   81;\n  9: 16384, 94208, 239616, 353792, 334144, 209328, 86976, 23112, 3564, 243;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (8+10*x+3*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 4 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(8 + 10*x + 3*x^2)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (8 + 10*x + 3*x^2)*v[i - 2]); 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-7196be931c2ed996","steps":["x \u21a6 x+1"],"edges":["e-1c523c2967bf00ac"],"text":"A152842 \u2192 x \u21a6 x+1"},"headline":"A152842 \u2192 x \u21a6 x+1","chain":null}