REVIEW 2 cited by
Strength is bounded linearly by Birch rank
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
abstract
Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on the degree of $f$ and the absolute transcendence degree of the field. This is the first linear bound obtained for forms of degree greater than three, partially resolving a conjecture of Adiprasito, Kazhdan and Ziegler. Our result has applications for the Hardy-Littlewood circle method. The circle method yields an asymptotic formula for counting integral zeros of (collections of) homogeneous polynomials, provided the Birch rank is sufficiently large -- a natural geometric condition. Our main theorem implies that these formulas hold even if we only assume a similar lower bound on the strength of the (collection of) homogeneous polynomials -- an arithmetic condition which is a priori weaker. This answers questions of Cook-Magyar and Skinner, and also yields a new proof of a seminal result of Schmidt as a consequence of Birch's earlier work. Over finite fields we obtain a quasi-linear bound for partition rank of tensors in terms of analytic rank, improving Moshkovitz-Zhu's state of the art bound.
Forward citations
Cited by 2 Pith papers
-
Density of solutions for systems of forms
Over Brauer fields, systems of degree-d forms with Birch rank above s^{2^{d-1}} C_d have Zariski dense solution sets, with C_d an explicit product of diagonal-form thresholds.
-
Strength and partition rank under limits and field extensions
For fixed degree d, strength and partition rank over any field are bounded by O(r^{d-1}) (plus a log factor on finite fields) in terms of their border rank analogues.
Discussion (0). Continue with ORCID to comment.