{"id":"n-6505ac1c0ddb87d9","revision":0,"first_index":0,"fingerprint":"f6-51fff267bcf07790","name":"basis_map_A013611 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","8"],["31","100","80"],["215","1044","1680","896"],["1597","10360","25088","26880","10752"],["12425","100880","326400","526080","422400","135168"],["99955","974700","3947760","8500800","10264320","6589440","1757184"],["824675","9387980","45676400","123126080","198598400","191679488","102502400","23429120"],["6939769","90331120","513162496","1661820160","3355416064","4325601280","3476881408","1593180160","318636032"],["59334605","869199768","5646850560","21353509632","51797491200","83583811584","89725009920","61786423296","24766709760","4402970624"],["513972967","8368434100","61193867280","264652752000","749660620800","1453279027200","1952659537920","1795586457600","1081479659520","385259929600","61641588736"],["4501041935","80634534596","655432162000","3190861766400","10337623296000","23402215710720","37773995212800","43474148720640","34962338611200","18711778426880","5998200750080","872465563648"],["39784038517","777676602600","6955913902080","37645212352000","137294928460800","355486825267200","670050949201920","926379727257600","932373271019520","666228726169600","320818051547136","93478453248000","12463793766400"],["354455513105","7507471950368","73277422466560","436419381944832","1769475315379200","5157706624671744","11119249630494720","17951371894849536","21703257640796160","19407264215465984","12476257560166400","5460388049059840","1458263870668800","179478630236160"],["3179928556219","72544207250620","767283304338096","4986986539604160","22252398954449664","72110275313556480","175010529437872128","323160743910850560","456223111562330112","490034256904192000","394210750596382720","230314550073753600","92381016206868480","22771351211212800","2602440138424320"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","13","211","3835","74677","1523353","32134159","695224543","15341968489","343991310949","7814295847723","179464195796899","4159993312833373","97200272163663409","2286901418289641959"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["5","8"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["5","8"],["10","16"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":205695,"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-edf2d7751a88dd9a"]},{"id":205696,"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-edf2d7751a88dd9a"]},{"id":205697,"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-edf2d7751a88dd9a"]},{"id":205698,"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-edf2d7751a88dd9a"]}],"region_exact":{},"incoming_edges":[{"id":"e-edf2d7751a88dd9a","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-6505ac1c0ddb87d9","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":"af0464ff94bd363367d8274a6458adb76edfb0791c8bc96fecd3b8f4d536577b","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,         8;\n  2:       31,       100,         80;\n  3:      215,      1044,       1680,         896;\n  4:     1597,     10360,      25088,       26880,       10752;\n  5:    12425,    100880,     326400,      526080,      422400,      135168;\n  6:    99955,    974700,    3947760,     8500800,    10264320,     6589440,     1757184;\n  7:   824675,   9387980,   45676400,   123126080,   198598400,   191679488,   102502400,    23429120;\n  8:  6939769,  90331120,  513162496,  1661820160,  3355416064,  4325601280,  3476881408,  1593180160,   318636032;\n  9: 59334605, 869199768, 5646850560, 21353509632, 51797491200, 83583811584, 89725009920, 61786423296, 24766709760, 4402970624;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (10*n+5+(16*n+8)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + 8*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 5 + 8*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (10*n + 5 + (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] = 5 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (10*n + 5 + (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":["x \u21a6 x+1","basis A013611"],"edges":["e-190c283dd8b47413","e-edf2d7751a88dd9a"],"text":"A033282 \u2192 x \u21a6 x+1 \u2192 basis A013611"},"headline":"A033282 \u2192 x \u21a6 x+1 \u2192 basis A013611","chain":null}
