{"id":"n-d1ffe586e8c0e96c","revision":1,"first_index":0,"fingerprint":"f6-9581fdced757748c","name":"basis_map_A013611 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"],["3","8"],["11","60","80"],["45","372","1008","896"],["197","2184","8960","16128","10752"],["903","12560","69120","188160","253440","135168"],["4279","71604","494640","1805760","3674880","3953664","1757184"],["20793","406700","3381840","15498560","42282240","68676608","61501440","23429120"],["103049","2306832","22432256","123771648","423847424","922521600","1246429184","955908096","318636032"],["518859","13081752","145656576","940063488","3875848704","10587193344","19161612288","22159687680","14860025856","4402970624"],["2646723","74213100","931017360","6881696640","33191208960","109152755712","247884349440","383884001280","388011786240","231155957760","61641588736"],["13648869","421298724","5879910960","48980279040","270589777920","1040988512256","2845885464576","5529009192960","7481451479040","6715376926720","3598920450048","872465563648"],["71039373","2393631000","36786562560","340986032640","2123227560960","9356529549312","29922313175040","69973575598080","118760183562240","142671489269760","115165454401536","56087071948800","12463793766400"],["372693519","13611535392","228411795456","2331866853888","16159155876864","80266945634304","294037808283648","804315410595840","1642939318665216","2475200383811584","2673483762892800","1960554759454720","874958322401280","179478630236160"],["1968801519","77471954532","1409467318896","15714445900608","119952357068544","663157096842240","2738389414785024","8580159735054336","20499563349737472","37165601622589440","50333901594296320","49380460320522240","33175503057715200","13662810726727680","2602440138424320"]],"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_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","8"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","8"],["6","16"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167948,"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-ca122abf64af43e3"]},{"id":167949,"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-ca122abf64af43e3"]},{"id":167950,"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-ca122abf64af43e3"]},{"id":167951,"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-ca122abf64af43e3"]}],"region_exact":{},"incoming_edges":[{"id":"e-ca122abf64af43e3","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-d1ffe586e8c0e96c","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":"b23e9aac5cbff88d967d604b25a16cd7fd51219926a51f5d1fe57219fe4d1d5a","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-66e2c3448245b0b7","role":"sequence","name":"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:      3,        8;\n  2:     11,       60,        80;\n  3:     45,      372,      1008,       896;\n  4:    197,     2184,      8960,     16128,      10752;\n  5:    903,    12560,     69120,    188160,     253440,      135168;\n  6:   4279,    71604,    494640,   1805760,    3674880,     3953664,     1757184;\n  7:  20793,   406700,   3381840,  15498560,   42282240,    68676608,    61501440,    23429120;\n  8: 103049,  2306832,  22432256, 123771648,  423847424,   922521600,  1246429184,   955908096,   318636032;\n  9: 518859, 13081752, 145656576, 940063488, 3875848704, 10587193344, 19161612288, 22159687680, 14860025856, 4402970624;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (6*n+3+(16*n+8)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 8*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 8*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (6*n + 3 + (16*n + 8)*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] = 3 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (6*n + 3 + (16*n + 8)*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":["basis A013611"],"edges":["e-ca122abf64af43e3"],"text":"A033282 \u2192 basis A013611"},"headline":"A033282 \u2192 basis A013611","chain":null}