solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看107次
Hilbert Series Of Binomial Edge Ideals. (arXiv:1807.07273v1 [math.AC])
来源于:arXiv
Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the
corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots,
x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of
binomial edge ideal of decomposable graphs in terms of Hilbert series of its
indecomposable subgraphs. Also, we compute the Hilbert series of binomial edge
ideal of join of two graphs and as a consequence we obtain the Hilbert series
of complete $k$-partite graph, fan graph, multi-fan graph and wheel graph. 查看全文>>