Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Badly approximable points on planar curves and winning (1409.0064v1)

Published 29 Aug 2014 in math.NT

Abstract: For any i,j>0 with i+j =1, let Bad(i,j) denote the set of points (x,y) \in R2 such that max { ||qx||{1/i}, \, ||qy||{1/j} } > c/q for some positive constant c = c(x,y) and all q in N. We show that \Bad(i,j) \cap C is winning in the sense of Schmidt games for a large class of planar curves C, namely, everywhere non-degenerate planar curves and straight lines satisfying a natural Diophantine condition. This strengthens recent results solving a problem of Davenport from the sixties. In short, within the context of Davenport's problem, the winning statement is best possible. Furthermore, we obtain the inhomogeneous generalizations of the winning results for planar curves and lines and also show that the inhomogeneous form of Bad(i,j) is winning for two dimensional Schmidt games.

Summary

We haven't generated a summary for this paper yet.