{"id":"n-121b38c57e66e001","revision":0,"first_index":0,"fingerprint":"f6-ca45a033a7374aea","name":"basis_map_A013610 of Triangular array: the fusion of polynomial sequences P and Q given by p(n,x)=(2x+1)^n and q(n,x)=(x+2)^n.","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"],["3","6"],["15","66","72"],["75","510","1152","864"],["375","3450","11880","18144","10368"],["1875","21750","100800","233280","269568","124416"],["9375","131250","765000","2376000","4147200","3856896","1492992"],["46875","768750","5400000","21060000","49248000","69050880","53747712","17915904"],["234375","4406250","36225000","170100000","498960000","936230400","1097349120","734552064","214990848"],["1171875","24843750","234000000","1285200000","4536000000","10668672000","16721510400","16840949760","9889579008","2579890176"],["5859375","138281250","1468125000","9234000000","38102400000","107775360000","211631616000","284862873600","251539292160","131574398976","30958682112"],["29296875","761718750","9000000000","63787500000","301320000000","996105600000","2351462400000","3963893760000","4676050944000","3676343500800","1733686198272","371504185344"],["146484375","4160156250","54140625000","426937500000","2272050000000","8596368000000","23710579200000","48037017600000","70946979840000","74494328832000","52784553000960","22661755305984","4458050224128"],["732421875","22558593750","320625000000","2784375000000","16483500000000","70246440000000","221709312000000","524712038400000","931179110400000","1223835402240000","1157854710988800","746723412541440","294231314792448","53496602689536"],["3662109375","121582031250","1873828125000","17769375000000","115830000000000","549034200000000","1951503840000000","5284071936000000","10952440012800000","17293326336000000","20475298381824000","17627873594572800","10431837524459520","3798258790957056","641959232274432"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","153","2601","44217","751689","12778713","217238121","3693048057","62781816969","1067290888473","18143945104041","308447066768697","5243600135067849","89141202296153433"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-5","-12"],["5","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":202401,"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-e48d4e69864d9283"]},{"id":202402,"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-e48d4e69864d9283"]},{"id":202403,"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-e48d4e69864d9283"]},{"id":202404,"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-e48d4e69864d9283"]}],"region_exact":{},"incoming_edges":[{"id":"e-e48d4e69864d9283","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-121b38c57e66e001","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":"20a3bad07c75693a89639adfc2da4554e20f7e7de93ef84fc09fb0186e56ac31","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-fecc05f84c905ae3","role":"sequence","name":"Triangular array: the fusion of polynomial sequences P and Q given by p(n,x)=(2x+1)^n and q(n,x)=(x+2)^n.","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:       3,        6;\n  2:      15,       66,        72;\n  3:      75,      510,      1152,        864;\n  4:     375,     3450,     11880,      18144,      10368;\n  5:    1875,    21750,    100800,     233280,     269568,      124416;\n  6:    9375,   131250,    765000,    2376000,    4147200,     3856896,     1492992;\n  7:   46875,   768750,   5400000,   21060000,   49248000,    69050880,    53747712,    17915904;\n  8:  234375,  4406250,  36225000,  170100000,  498960000,   936230400,  1097349120,   734552064,  214990848;\n  9: 1171875, 24843750, 234000000, 1285200000, 4536000000, 10668672000, 16721510400, 16840949760, 9889579008, 2579890176;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (5*n-5+(12*n-12)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 6*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 6*x;\nP[n_, x_] := P[n, x] = Expand[Together[((5*n - 5 + (12*n - 12)*x)*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = ((5*n - 5 + (12*n - 12)*x)*v[i - 1])/(n - 1)); 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-fecc05f84c905ae3","steps":["basis A013610"],"edges":["e-e48d4e69864d9283"],"text":"A193734 \u2192 basis A013610"},"headline":"A193734 \u2192 basis A013610","chain":null}
