{"id":"n-4cb0c85eec08b520","revision":0,"first_index":0,"fingerprint":"f6-bbd868fe5e275603","name":"basis_map_A008277 of basis_map_A013610 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"],["9","6"],["101","180","45"],["1269","4626","2835","378"],["17081","115416","130914","40824","3402"],["240849","2878926","5406750","2966220","561330","32076"],["3511741","72449964","212493051","182833200","59019840","7505784","312741"],["52515549","1844447226","8158151925","10350447030","5074048980","1078052976","98513415","3127410"],["801029681","47518347888","309910640292","558170685072","390187393596","123224957856","18532197684","1275983280","31899582"],["12414177369","1238117359446","11727833810940","29235324623544","28021669226460","12343857474312","2717444191644","304461210456","16364485566","330595668"],["194922521301","32595290786916","443765691846009","1504092715463520","1924929665830080","1136603380781232","343595334423978","55705370058000","4829176220310","208275270840","3471254514"],["3094216933509","866145650448546","16824592380931335","76537606810104594","128331245723594760","98850006759274848","39418866402670062","8673500816649108","1078325188305750","74477990761020","2634682176126","36848701764"],["49575333021801","23207871661398216","639853673210423334","3869287745292157320","8380910322654088230","8258281486545971232","4226424726301170228","1212209338754106000","202684671063902610","19932094476177840","1122606227440764","33163831587600","394807518900"],["800645021406369","626455031934028446","24423654187392357690","194896574006423334084","539511715818229264110","670166111834783913492","431498307791969141724","156919265541026249976","33886445449550107986","4449234378696106428","354692206045122660","16601235041724840","415732317401700","4263921204120"],["13020241953611181","17021596799589306588","935918154870420704967","9800214533434183923792","34382235255060535171056","53232847086136712530536","42478703225395638480279","19196783785598540687280","5207225726970066578922","876545850054457182600","92743205769278514450","6113981183612014440","241572811146185610","5193456026618160","46370143094805"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","15","326","9108","307637","12086151","538126321","26659304511","1449653134931","85617817155405","5446523294456700","370660533470551422","26833997670158964075","2056750278122351363625","166226612234152304604666"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["9","6"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["9","6"],["18","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","6"],["0","12"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":197623,"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-df70174e49f87bd5"]},{"id":197624,"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-df70174e49f87bd5"]},{"id":197625,"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-df70174e49f87bd5"]}],"region_exact":{},"incoming_edges":[{"id":"e-df70174e49f87bd5","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-4cb0c85eec08b520","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":"9ffdcab549f44a0a2909f51d5da7c790656dfd7b17c9759385335f404418578a","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-bc0842751fa5b570","role":"sequence","name":"basis_map_A013610 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:           9,             6;\n  2:         101,           180,             45;\n  3:        1269,          4626,           2835,            378;\n  4:       17081,        115416,         130914,          40824,           3402;\n  5:      240849,       2878926,        5406750,        2966220,         561330,          32076;\n  6:     3511741,      72449964,      212493051,      182833200,       59019840,        7505784,        312741;\n  7:    52515549,    1844447226,     8158151925,    10350447030,     5074048980,     1078052976,      98513415,      3127410;\n  8:   801029681,   47518347888,   309910640292,   558170685072,   390187393596,   123224957856,   18532197684,   1275983280,    31899582;\n  9: 12414177369, 1238117359446, 11727833810940, 29235324623544, 28021669226460, 12343857474312, 2717444191644, 304461210456, 16364485566, 330595668;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (18*n+9+(12*n+6)*x)*P(n-1,x) + (12*n+6)*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 9 + 6*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 9 + 6*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (18*n + 9 + (12*n + 6)*x)*P[n - 1, x] + (12*n + 6)*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] = 9 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (18*n + 9 + (12*n + 6)*x)*v[i - 1] + (12*n + 6)*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 A013610","basis A008277"],"edges":["e-13974c051c6d411c","e-df70174e49f87bd5"],"text":"A033282 \u2192 basis A013610 \u2192 basis A008277"},"headline":"A033282 \u2192 basis A013610 \u2192 basis A008277","chain":null}
