Optimal density for values of generic polynomial maps

Type: Article

Publication Date: 2020-01-01

Citations: 8

DOI: https://doi.org/10.1353/ajm.2020.0049

Abstract

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $|Q(x)-\\xi|<\\epsilon$ for a generic ternary form $Q$ is $|x|\\ll\\epsilon^\{-1\}$. We also establish an optimal rate of density for the values of polynomials maps in a number of other natural problems, including the values of linear forms restricted to suitable quadratic surfaces, and the values of the polynomial map defined by the generators of the ring of conjugation-invariant polynomials on $M_3(\\Bbb\{C\})$.

Locations

  • American Journal of Mathematics - View
  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ Optimal density for values of generic polynomial maps 2018 Anish Ghosh
Alexander Gorodnik
Amos Nevo
+ Optimal density for values of generic polynomial maps 2018 Anish Ghosh
Alexander Gorodnik
Amos Nevo
+ PDF Chat Extremal functions on moduli spaces and applications 2024 Nikolaj Glazunov
+ Diophantine approximation on lines in \mathbb{C}^2 with Gaussian prime constraints - enhanced version 2017 Stephan Baier
+ Diophantine approximation on lines in \mathbb{C}^2 with Gaussian prime constraints - enhanced version 2017 Stephan Baier
+ Distributions of polynomial forms 1992 A. Basalykas
+ PDF Chat Small solutions of generic ternary quadratic congruences to general moduli 2024 Stephan Baier
Aishik Chattopadhyay
+ Existence of Polynomial Parametrizations 2024 Bogdan Grechuk
+ PDF Chat A PTAS for the minimization of polynomials of fixed degree over the simplex 2006 Etienne de Klerk
Monique Laurent
Pablo A. Parrilo
+ Bounds on degrees of p-adic separating polynomials 2008 Daniel J. Katz
Joshua Zahl
+ Finding Zeros of Rational Quadratic Forms 2014 John F Shaughnessy
+ Extremal Problems for Polynomials 1994
+ Extremal Problems for Polynomials 1978 R. P. Boas
+ Min problems for complex polynomials 2003 Bl. Sendov
Nikolay Nikolov
+ Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization 2016 Mohab Safey El Din
Éric Schost
+ Bit complexity for multi-homogeneous polynomial system solving Application to polynomial minimization 2016 Mohab Safey El Din
Éric Schost
+ S-parts of values of univariate polynomials, binary forms and decomposable forms at integral points 2017 Yann Bugeaud
Jan‐Hendrik Evertse
Kálmán Győry
+ S-parts of values of univariate polynomials, binary forms and decomposable forms at integral points 2017 Yann Bugeaud
Jan‐Hendrik Evertse
Kálmán Győry
+ Potential Theoretic Tools in Polynomial and Rational Approximation 2006 Eli Levin
Edward B. Saff
+ Diophantine approximation for products of linear maps — logarithmic improvements 2016 Alexander Gorodnik
Pankaj Vishe

Works Cited by This (0)

Action Title Year Authors