Degree and regularity of Eulerian ideals of hypergraphs

From MaRDI portal



Abstract: We define the Eulerian ideal of a k-uniform hypergraph and study its degree and Castelnuovo--Mumford regularity. The main tool is a Gr"obner basis of the ideal obtained combinatorially from the hypergraph. We define the notion of parity join in a hypergraph and show that the regularity of the Eulerian ideal is equal to the maximum cardinality of such a set of edges. The formula for the degree involves the cardinality of the set of sets of vertices, T, that admit a T-join. We compute the degree and regularity explicity in the cases of a complete k-partite hypergraph and a complete hypergraph of rank 3.


Suppose that \(K\) is a field and \(H\) is a hypergraph with vertex set \(V\) and edge set \(E\). Also here we assume that \(H\) is \(k\)-uniform, that is, all edges of \(H\) have a common size \(k\). Let \(K[V]=K[x_v|v\in V]\) and \(K[E]=K[t_e|e\in E]\) be polynomial rings. If \(\phi:K[E]\to K[V]\) is the ring homomorphism sending \(t_e\) for \(e=\{v_1,\ldots,v_k\}\) to \(x_{v_1}x_{v_2}\cdots x_{v_k}\), then the authors call the ideal \(I_H=\phi^{-1}(\langle x_v^2-x_w^2|v,w\in V\rangle)\), the Eulerian ideal of \(H\), which is a binomial ideal. In the case that \(k=2\), that is, \(H\) is a graph, this ideal is studied in the paper by \textit{J. Neves} [``Eulerian ideals, Comm. Algebra 51, No. 2, 552--564 (2023)]. The results of the paper under review can be seen as generalizations of the results of the aforementioned paper to hypergraphs. The authors first present a binomial Gröbner basis for \(I_H\). Then by combinatorially interpreting the monomials not in the initial ideal of \(I_H\), they present formulas for the Hilbert function and the Hilbert series of \(K[E]/I_H\) in terms of some combinatorial quantities of \(H\). They deduce that \(K[E]/I_H\) is a 1-dimensional Cohen-Macaulay ring. They use these, to present formulas for the Castelnuovo-Mumford regularity and the multiplicity (or degree) of \(K[E]/I_H\). At the end, they consider complete \(k\)-partite hypergraphs and also complete hypergraphs and find explicit formulas for the regularity and degree of \(K[E]/I_H\) in terms of the number of vertices and part sizes of \(H\). The regularity of \(K[E]/I_H\), when \(H\) is a complete hypergraph, is presented in the case that \(k=3\).





Describes a project that uses

Uses Software






This page was built for publication: Degree and regularity of Eulerian ideals of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2094866)