{"id":"n-6278112a2d49c618","revision":0,"first_index":0,"fingerprint":"f6-3ad12bf5850f5489","name":"basis_map_A008277 of basis_map_A013609 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"],["7","4"],["61","90","20"],["595","1726","924","112"],["6217","32004","31136","8736","672"],["68047","591304","934560","456480","79200","4224"],["770149","10991862","26603916","20163000","5926800","700128","27456"],["8939707","206257594","737753940","815550120","361561200","71014944","6086080","183040"],["105843409","3910112712","20196654368","31344881568","19678634976","5717712000","803618816","52276224","1244672"],["1273241431","74873417740","549755729952","1167629416096","998080181280","402563126784","82529900544","8712477696","445026816","8599552"],["15517824973","1447293396978","14940054344644","42648459533680","48331374232960","26003380725504","7294586277888","1111309355520","91359490560","3762304000","60196864"],["191202877411","28218779627350","406305552624972","1538475809366496","2267767264963200","1583889248361728","584040441836544","120432218767872","14168113344000","932761984000","31631136768","426008576"],["2377843390873","554526032706828","11073008542807744","55066959404050880","104091579512423360","92543995139464704","43638573343602688","11697857943045120","1846866245199360","172820648704000","9317294424064","264733900800","3042918400"],["29807864423071","10974160896307600","302638773649198272","1961784892479262656","4704059285711522880","5245830424868743424","3100881925223706624","1051066432710767616","213863253112244736","26673008965537792","2032526474035200","91386751139840","2207333007360","21909012480"],["376255282112629","218562887485625742","8298557505644776828","69708356439195503848","210238837535219920336","290747064242371857120","212227617412963728576","89148916273382469504","22736189762700640512","3629195804538304000","366517593705303040","23183164648949760","882594982563840","18346059325440","158840340480"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","11","171","3357","78765","2133815","65183311","2207346625","81810978745","3285871117891","141887157683571","6544453450898917","320698149726638821","16619928107948909551","907344275977021421655"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["7","4"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["7","4"],["14","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4"],["0","8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":197452,"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-5e62cf5fc999b3bc"]},{"id":197453,"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-5e62cf5fc999b3bc"]},{"id":197454,"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-5e62cf5fc999b3bc"]}],"region_exact":{},"incoming_edges":[{"id":"e-5e62cf5fc999b3bc","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-6278112a2d49c618","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"b895d902e484a9462b63712d305b319feeb52a0cadfe3af0042380fb232c8454","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-8217f7f3de935aeb","role":"sequence","name":"basis_map_A013609 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:          7,           4;\n  2:         61,          90,           20;\n  3:        595,        1726,          924,           112;\n  4:       6217,       32004,        31136,          8736,          672;\n  5:      68047,      591304,       934560,        456480,        79200,         4224;\n  6:     770149,    10991862,     26603916,      20163000,      5926800,       700128,       27456;\n  7:    8939707,   206257594,    737753940,     815550120,    361561200,     71014944,     6086080,     183040;\n  8:  105843409,  3910112712,  20196654368,   31344881568,  19678634976,   5717712000,   803618816,   52276224,   1244672;\n  9: 1273241431, 74873417740, 549755729952, 1167629416096, 998080181280, 402563126784, 82529900544, 8712477696, 445026816, 8599552;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (14*n+7+(8*n+4)*x)*P(n-1,x) + (8*n+4)*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 7 + 4*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (14*n + 7 + (8*n + 4)*x)*P[n - 1, x] + (8*n + 4)*x*D[P[n - 1, x], 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] = 7 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (14*n + 7 + (8*n + 4)*x)*v[i - 1] + (8*n + 4)*x*deriv(v[i - 1], x))/(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 A013609","basis A008277"],"edges":["e-4e2df72103232439","e-5e62cf5fc999b3bc"],"text":"A033282 \u2192 basis A013609 \u2192 basis A008277"},"headline":"A033282 \u2192 basis A013609 \u2192 basis A008277","chain":null}
