On Ranks of Polynomials
- 21 Downloads
Let V be a vector space over a field k, P : V → k, d ≥ 3. We show the existence of a function C(r, d) such that rank(P) ≤ C(r, d) for any field k, char(k) > d, a finite-dimensional k-vector space V and a polynomial P : V → k of degree d such that rank(∂P/∂t) ≤ r for all t ∈ V − 0. Our proof of this theorem is based on the application of results on Gowers norms for finite fields k. We don’t know a direct proof even in the case when k = ℂ.
Mathematics Subject Classification (2010)11B30 14J99
Unable to display preview. Download preview PDF.
- 1.Bhowmick, A, Lovett, S: Bias vs structure of polynomials in large fields, and applications in effective. arXiv:1506.02047
- 2.Derksen, H, Eggermont, R., Snowden, A.: Topological noetherianity for cubic polynomials. arXiv:1701.01849
- 4.Hartshorne, R.: Algebraic Geometry Graduate Texts in Mathematics, No. 52. Springer, Heidelberg (1977)Google Scholar
- 5.Kazhdan, D., Ziegler, T.: Approximate cohomology. Sel. Math. New Ser (2017)Google Scholar
- 6.Markel, D.: Model theory:an introduction graduate texts of mathematics. SpringerGoogle Scholar