{"id":"n-23d52b9eb8e45fdd","revision":0,"first_index":0,"fingerprint":"f6-bffe79c3825a54d3","name":"basis_map_A013610 of basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","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":false,"rows":[["1"],["5","6"],["31","75","45"],["215","783","945","378"],["1597","7770","14112","11340","3402"],["12425","75660","183600","221940","133650","32076"],["99955","731025","2220615","3586275","3247695","1563705","312741"],["824675","7040985","25692975","51943815","62837775","45486441","18243225","3127410"],["6939769","67748340","288653904","701080380","1061674614","1026485460","618810192","212663880","31899582"],["59334605","651899826","3176353440","9008511876","16389049950","19834830288","15969124080","8247491928","2479467510","330595668"],["513972967","6276325575","34421550345","111650379750","237197305800","344869925400","347531446080","239681859300","108270081270","28927120950","3471254514"],["4501041935","60475900947","368680591125","1346144807700","3270888621000","5553455486040","6722959597200","5803098343020","3500181634950","1404968012910","337779766170","36848701764"],["39784038517","583257451950","3912701569920","15881573961000","43440973458300","84358689980400","119254673332080","123656766571800","93342606066270","50023574894700","18066392064864","3948075189000","394807518900"],["354455513105","5630603962776","41218550137440","184114426757976","559873049006700","1223947958784408","1978987544099280","2396218892458248","2172776388263910","1457188345157688","702581913633600","230620232040120","46192479711300","4263921204120"],["3179928556219","54408155437965","431596858690179","2103884946395505","7040798106681339","17112106348822485","31148114248097847","43136752132142955","45673825606696287","36794068445759625","22199392902341655","9727366352537925","2926293589710855","540985002772725","46370143094805"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","11","151","2321","38221","659351","11762011","215197301","4015956121","76146659171","1462811221951","28409982504761","556903876097701","11003968760730671","218939142767738371"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["5","6"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["5","6"],["10","12"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":202871,"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-38f0c050e99fe9f7"]},{"id":202872,"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-38f0c050e99fe9f7"]},{"id":202873,"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-38f0c050e99fe9f7"]},{"id":202874,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-38f0c050e99fe9f7"]}],"region_exact":{},"incoming_edges":[{"id":"e-38f0c050e99fe9f7","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-23d52b9eb8e45fdd","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":"67052bdb2939fed7eb829290cadca55a5729143320b7026d4142e7b9b9763003","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-07af2e6e3c9f0c77","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","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:        5,         6;\n  2:       31,        75,         45;\n  3:      215,       783,        945,        378;\n  4:     1597,      7770,      14112,      11340,        3402;\n  5:    12425,     75660,     183600,     221940,      133650,       32076;\n  6:    99955,    731025,    2220615,    3586275,     3247695,     1563705,      312741;\n  7:   824675,   7040985,   25692975,   51943815,    62837775,    45486441,    18243225,    3127410;\n  8:  6939769,  67748340,  288653904,  701080380,  1061674614,  1026485460,   618810192,  212663880,   31899582;\n  9: 59334605, 651899826, 3176353440, 9008511876, 16389049950, 19834830288, 15969124080, 8247491928, 2479467510, 330595668;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (10*n+5+(12*n+6)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + 6*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 5 + 6*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (10*n + 5 + (12*n + 6)*x)*P[n - 1, x])/(n + 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 5 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (10*n + 5 + (12*n + 6)*x)*v[i - 1])/(n + 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-66e2c3448245b0b7","steps":["x \u21a6 x+1","basis A013610"],"edges":["e-190c283dd8b47413","e-38f0c050e99fe9f7"],"text":"A033282 \u2192 x \u21a6 x+1 \u2192 basis A013610"},"headline":"A033282 \u2192 x \u21a6 x+1 \u2192 basis A013610","chain":null}