The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles

Antonio Macchia; Margherita Barile

The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1511.07310 v1 pith:ZOBJYSV2 submitted 2015-11-23 math.AC math.CO

Margherita Barile , Antonio Macchia This is my paper · ORCID

classification math.ACmath.CO

keywords cyclesarithmeticaledgepairwiserankaboveassociatedbounded

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.

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

Enhancing VICReg: Random-Walk Pairing for Improved Generalization and Better Global Semantics Capturing
cs.CV 2025-06 conditional novelty 5.0 of 10

Random-walk pairing between similar images improves VICReg's generalization and global semantic structure, and a new dendrogram-based metric measures this without labels.

Pith tools