{"id":"n-4334eb2bf6ae95c5","revision":1,"first_index":0,"fingerprint":"f6-0ac62b5988cd80b7","name":"basis_map_A013610 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"],["2","3"],["5","15","9"],["14","63","81","27"],["43","258","513","378","81"],["142","1065","2880","3375","1620","243"],["499","4491","15390","24975","19440","6561","729"],["1850","19425","80703","168210","184275","102060","25515","2187"],["7193","86316","421722","1076544","1533735","1211112","500094","96228","6561"],["29186","394011","2214216","6700806","11808342","12262509","7287084","2322594","354294","19683"],["123109","1846635","11736495","41119650","86589405","112260897","88562565","40875030","10333575","1279395","59049"],["538078","8878287","62975385","250883325","615645360","961165359","954653931","589276215","216513000","44385165","4546773","177147"],["2430355","43746390","342626031","1530313290","4293372600","7861587030","9471601755","7414704198","3663399960","1093390650","185118615","15943230","531441"],["11317646","220694097","1891814184","9366218433","29597229090","62300509128","88585764696","84683069757","53383012254","21504071160","5302836396","753051897","55269864","1594323"],["54229907","1138828047","10605958272","57664367397","202789175589","483034868316","793805773761","900907056621","697612896981","360243855972","120166663617","24841500957","2998390122","189724437","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","29","185","1273","9325","72085","584225","4939505","43392725","394785805","3709638025","35918765545","357656452925","3656058072965"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-3"],["1","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167138,"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-4ab452bc24d56cb0"]},{"id":167139,"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-4ab452bc24d56cb0"]},{"id":167140,"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-4ab452bc24d56cb0"]},{"id":167141,"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-4ab452bc24d56cb0"]}],"region_exact":{},"incoming_edges":[{"id":"e-4ab452bc24d56cb0","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-4334eb2bf6ae95c5","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":"65286c61ff1bf9f5ceeab39348b4f00950a1a02df41e495b347236538e184637","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-07e5356ad37f61ea","role":"sequence","name":"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:     2,      3;\n  2:     5,     15,       9;\n  3:    14,     63,      81,      27;\n  4:    43,    258,     513,     378,       81;\n  5:   142,   1065,    2880,    3375,     1620,      243;\n  6:   499,   4491,   15390,   24975,    19440,     6561,     729;\n  7:  1850,  19425,   80703,  168210,   184275,   102060,   25515,    2187;\n  8:  7193,  86316,  421722, 1076544,  1533735,  1211112,  500094,   96228,   6561;\n  9: 29186, 394011, 2214216, 6700806, 11808342, 12262509, 7287084, 2322594, 354294, 19683;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n-1+(3*n-3)*x)*P(n-2,x) + (2+3*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 3*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 3*x;\nP[n_, x_] := P[n, x] = Expand[(n - 1 + (3*n - 3)*x)*P[n - 2, x] + (2 + 3*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (n - 1 + (3*n - 3)*x)*v[i - 2] + (2 + 3*x)*v[i - 1]); 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":["basis A013610"],"edges":["e-4ab452bc24d56cb0"],"text":"A100862 \u2192 basis A013610"},"headline":"A100862 \u2192 basis A013610","chain":null}