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

星基下树的色对称函数

The chromatic symmetric function in the star-basis

Michael Gonzalez, Rosa Orellana, Mario Tomba

AI总结:

本文利用删除-近收缩算法研究树在星基下的色对称函数,确定了字典序最小的索引划分及其系数公式,并将CSF重构结果推广到所有直径不超过5的树,同时给出了n顶点树CSF张成子空间的维数公式。

摘要:

我们研究树在星基下表示的Stanley色对称函数(CSF)。我们使用文献[ADOZ]中最近引入的删除-近收缩算法来计算星基下CSF中出现的系数。特别地,我们的主要结果之一确定了CSF中作为索引划分出现的字典序最小划分,并给出了其系数的公式。除了描述星基系数所编码的树的性质外,我们还给出了首项系数结果的两个主要应用。第一个应用加强了文献[ADOZ]中的结果,该结果表明直径小于或等于5的真树可以从其CSF中重构。在本文中,我们证明这对所有直径小于或等于5的树都成立。在第二个应用中,我们证明了由n个顶点的树的CSF所张成的对称函数子空间的维数为p(n)-n+1,其中p(n)是n的划分数。

英文摘要:

We study Stanley's chromatic symmetric function (CSF) for trees when expressed in the star-basis. We use the deletion-near-contraction algorithm recently introduced in \cite{ADOZ} to compute coefficients that occur in the CSF in the star-basis. In particular, one of our main results determines the smallest partition in lexicographic order that occurs as an indexing partition in the CSF, and we also give a formula for its coefficient. In addition to describing properties of trees encoded in the coefficients of the star-basis, we give two main applications of the leading coefficient result. The first is a strengthening of the result in \cite{ADOZ} that says that proper trees of diameter less than or equal to 5 can be reconstructed from their CSFs. In this paper we show that this is true for all trees of diameter less than or equal 5. In our second application, we show that the dimension of the subspace of symmetric functions spanned by the CSF of $n$-vertex trees is $p(n)-n+1$, where $p(n)$ is the number of partitions of $n$.

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

↑