{"id":"n-5ce9960a81812aba","revision":0,"first_index":0,"fingerprint":"f6-bb252498ca869348","name":"basis_map_A008277 of basis_map_A007318 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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","1"],["11","8","1"],["45","55","15","1"],["201","370","166","24","1"],["963","2521","1660","390","35","1"],["4899","17602","15991","5430","785","48","1"],["26253","126463","152523","70231","14525","1421","63","1"],["147345","936040","1460040","875896","242886","33740","2380","80","1"],["862083","7136641","14128680","10744840","3835146","708582","70560","3756","99","1"],["5238459","56007832","138765841","131153400","58589770","13815396","1818642","136020","5655","120","1"],["32957037","451989847","1386350647","1604215041","878838950","257065138","42913794","4222482","245685","8195","143","1"],["214117209","3746797930","14105526238","19751502144","13065699911","4643633016","955299136","118609656","9043287","420750","11506","168","1"],["1433320515","31868427865","146243138340","245503649326","193738386413","82354303031","20445831120","3112389280","298237797","18122247","689260","15730","195","1"],["9867008979","277815674962","1545279857031","3086484514750","2877566475147","1444997513960","426085122463","77865942440","9110557885","693434742","34347313","1087450","21021","224","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","20","116","762","5570","44756","391480","3698408","37490388","405531136","4658806960","56610660952","725016511120","9755801558368"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-2","-1"],["2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196669,"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-0100c22d89b31e4d"]},{"id":196670,"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-0100c22d89b31e4d"]},{"id":196671,"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-0100c22d89b31e4d"]}],"region_exact":{},"incoming_edges":[{"id":"e-0100c22d89b31e4d","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-5ce9960a81812aba","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":"375a5857a867e7a3e96f15d8db3b85ff693e9a02379994298fb03a7fb5fc5053","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-6bbd968fe5cbbe11","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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,       1;\n  2:     11,       8,        1;\n  3:     45,      55,       15,        1;\n  4:    201,     370,      166,       24,       1;\n  5:    963,    2521,     1660,      390,      35,      1;\n  6:   4899,   17602,    15991,     5430,     785,     48,     1;\n  7:  26253,  126463,   152523,    70231,   14525,   1421,    63,    1;\n  8: 147345,  936040,  1460040,   875896,  242886,  33740,  2380,   80,  1;\n  9: 862083, 7136641, 14128680, 10744840, 3835146, 708582, 70560, 3756, 99, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-2+(n-1)*x)*P(n-2,x) + (n-1)*x*d/dx P(n-2,x) + (3+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[(2*n - 2 + (n - 1)*x)*P[n - 2, x] + (n - 1)*x*D[P[n - 2, x], x] + (3 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 2 + (n - 1)*x)*v[i - 2] + (n - 1)*x*deriv(v[i - 2], x) + (3 + x)*v[i - 1] + x*deriv(v[i - 1], x)); 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-07e5356ad37f61ea","steps":["x \u21a6 x+1","basis A008277"],"edges":["e-2fc15f707287930e","e-0100c22d89b31e4d"],"text":"A100862 \u2192 x \u21a6 x+1 \u2192 basis A008277"},"headline":"A100862 \u2192 x \u21a6 x+1 \u2192 basis A008277","chain":null}
