Pith. sign in

REVIEW 2 cited by

Matrix factorizations of generic polynomials

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 2112.08864 v6 pith:IYUUMCRQ submitted 2021-12-16 math.AC math.AG

Daniel Erman This is my paper · ORCID
classification math.ACmath.AG
keywords genericmatrixpolynomialstrengthbuchweitz-greuel-schreyerconjecturedegreeerman
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and uses a variant of the ultraproduct technique of Erman, Sam, and Snowden.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Slice rank and partition rank of the determinant

    math.CO 2025-09 conditional novelty 8.0 of 10

    The determinant has slice rank n, partition rank at least log2(n)+1, and the 4x4 determinant has partition rank 3, giving the first unbounded separation between partition rank and analytic rank.

  2. A linear lower bound on the Ulrich complexity of hypersurfaces

    math.AG 2026-07 conditional novelty 7.0 of 10

    Smooth hypersurfaces of dimension n≥6 and degree d≥3 have Ulrich complexity at least roughly linear in n (n-1 or n-2, or F of half-dimension for smaller n).

Pith tools