arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.01233math.CO
收藏

拟阵复形的三角图、加权森林和h-向量

Triconed Graphs, weighted forests, and h-vectors of matroid complexes

Jacob David, Pierce Lai, SuHo Oh, Christopher Wu

摘要:

Stanley的一个著名猜想是拟阵的h-向量是纯O-序列。关于这个猜想已经有许多部分进展的论文,但它仍然是开放的。特别是对于以图的生成树为基的图拟阵,该猜想大多未解。在图论中,如果一个顶点集的每一个其他顶点都与所选集合中的某个顶点相邻,则该顶点集被称为控制顶点集。Kook证明了锥图的Stanley猜想,锥图是由一个顶点控制的一类图。Cranford等人将该结果扩展到双锥图,这是一类由单条边控制的图。在本文中,我们将这一结果推广到三锥图,一类图的长度为2的道路占主导地位。

英文摘要:

A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from taking the spanning trees of a graph as bases, the conjecture is mostly unsolved. In graph theory, a set of vertices is called dominating if every other vertex is adjacent to some vertex inside the chosen set. Kook proved Stanley's conjecture for coned graphs, which is the class of graphs that are dominated by a single vertex. Cranford et al extended that result to biconed graphs, which is the class of graphs dominated by a single edge. In this paper we extend that result to triconed graphs, the class of graphs dominated by a path of length 2.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑