REVIEW 4 cited by
Matrix factorizations of generic polynomials
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
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.
Forward citations
Cited by 4 Pith papers
-
Slice rank and partition rank of the determinant
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.
-
A linear lower bound on the Ulrich complexity of hypersurfaces
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).
-
On the projective normality of Ulrich bundles on some low-dimensional varieties
For curves, surfaces with q=pg=0, and hypersurfaces of dimension 2 or 3, the paper gives criteria for when Ulrich bundles are projectively normal, with a likely error in the hypersurface determinant computation.
-
Ranks of matrix factorizations and sheaf cohomology
A graded Buchweitz-Greuel-Schreyer rank conjecture is shown equivalent to a new sheaf-cohomology lower bound on non-Fano hypersurfaces, with a new exact Betti-number-to-cohomology formula as the bridge.
Discussion (0). Continue with ORCID to comment.