Hypergraphs with high projective dimension and 1-dimensional hypergraphs

DOI10.1142/S0218196717500291MaRDI QIDQ4588868zbMATH OpenOpenAlexFDO

Authors Kuei-Nuan Lin, Paolo Mantero

Publication date 3 November 2017

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.01331

zbMATH Keywords

hypergraphprojective dimensionsquarefree monomial idealdual hypergraph

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Syzygies, resolutions, complexes and commutative rings (13D02)

Abstract: We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective explicit procedure to compute the projective dimension of 1-dimensional hypergraphs $mathcalH$ when each connected component contains at most one cycle. An algorithm to compute the projective dimension is also included. Applications of these results are given; they include, for instance, computing the projective dimension of monomial ideals whose associated hypergraph has a spanning Ferrers graph.

Recommendations

• Projective dimension of string and cycle hypergraphs
• Resolutions of monomial ideals of projective dimension 1
• Projective dimension of hypergraphs
• Lattices and hypergraphs associated to square-free monomial ideals
• Monomial ideals with large projective dimension

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• Arithmetical rank of a squarefree monomial ideal whose Alexander dual is of deviation two
• Arithmetical rank of squarefree monomial ideals generated by five elements or with arithmetic degree four
• Arithmetical rank of squarefree monomial ideals of small arithmetic degree
• Arithmetical rank of strings and cycles
• Bounds on the regularity and projective dimension of ideals associated to graphs
• Further applications of clutter domination parameters to projective dimension
• HYPERGRAPHS AND REGULARITY OF SQUARE-FREE MONOMIAL IDEALS
• Lattices and hypergraphs associated to square-free monomial ideals
• Normal 0-1 polytopes
• Projective dimension of string and cycle hypergraphs
• Projective dimension, graph domination parameters, and independence complex homology
• Regularity of squarefree monomial ideals
• Regularity, depth and arithmetic rank of bipartite edge ideals
• Results on the regularity of square-free monomial ideals
• The lcm-lattice in monomial resolutions
• The uniform face ideals of a simplicial complex

Cited in

(7)

• Lattices and hypergraphs associated to square-free monomial ideals
• Depth of powers of squarefree monomial ideals (research)
• On perfect balanced rainbow-free colorings and complete colorings of projective spaces
• Monomial ideals with large projective dimension
• Projective dimension of string and cycle hypergraphs
• Projective dimension of hypergraphs
• Further applications of clutter domination parameters to projective dimension

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Hypergraphs with high projective dimension and 1-dimensional hypergraphs

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