Paper detail

Projective dimension of Hypergraphs

Given a square-free monomial ideal $I$, satisfying certain hypotheses, in a polynomial ring $R$ over a field $\mathbb{K}$, we compute the projective dimension of $I$. Specifically, we focus on the cases where the 1-skeleton of an associated hypergraph is either a string or a cycle. We investigate the impact on the projective dimension when higher dimensional edges are removed. We prove that the higher dimensional edge either has no effect on the projective dimension or the projective dimension only goes up by one with the extra higher dimensional edge.

preprint2021arXivOpen access
0citations
0reviews
0saves
Nocode
Nodataset
0institutions

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.