Pith. sign in

REVIEW 1 cited by

Intersections of Leray complexes and regularity of monomial ideals

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0601745 v1 pith:NYU5ED7C submitted 2006-01-30 math.CO math.AC

classification math.COmath.AC
keywords complexessigmasimplicialthencomplexd-lerayidealsmonomial
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

For a simplicial complex X and a field K, let h_i(X)=\dim \tilde{H}_i(X;K). It is shown that if X,Y are complexes on the same vertex set, then for all k h_{k-1}(X\cap Y) \leq \sum_{\sigma \in Y} \sum_{i+j=k} h_{i-1}(X[\sigma])\cdot h_{j-1}(\lk(Y,\sigma)) . A simplicial complex X is d-Leray over K, if h_i(Y)=0 for all induced subcomplexes Y \subset X and i \geq d. Let L_K(X) denote the minimal d such that X is d-Leray over K. The above theorem implies that if X,Y are simplicial complexes on the same vertex set then L_K(X \cap Y) \leq L_K(X) +L_K(Y). Reformulating this inequality in commutative algebra terms, we obtain the following result conjectured by Terai: If I,J are square-free monomial ideals in S=K[x_1,...,x_n], then reg(I+J) \leq reg(I)+reg(J)-1 where reg(I) denotes the Castelnuovo-Mumford regularity of I.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The edge ideal of a graph and its splitting graphs

    math.AC 2019-08 accept novelty 6.0 of 10

    For a graph G and any of its splitting graphs G', the paper proves inequalities such as reg(I(G)) <= reg(I(G')) and proj dim(I(G)) <= proj dim(I(G')) for special splittings and many graph classes.

Pith tools