相关论文: Sets of inhomogeneous linear forms can be not isot…

While many types of non-measurable sets are never $(\alpha, \beta)$-winning in the sense of Schmidt's game, we show that this is not the case for certain Vitali sets. Our main theorems show that for certain values of $\alpha, \beta$ one can…

Given a target set $A\subseteq \mathbb{R}^d$ and a real number $\beta\in (0,1)$, McMullen introduced the notion of $A$ being an absolutely $\beta$-winning set. This involves a two player game which we call the $\beta$-McMullen game. We…

In this paper we discuss some properties of completely irrational subspaces. We prove that there exist completely irrational subspaces that are badly approximable and, moreover, sets of such subspaces are winning in different senses. We get…

We prove that the set of (r_1,r_2,..,r_{d})-badly approximable vectors is a winning set if r_1=r_2=...=r_{d-1}\geq r_{d}.

We prove the hyperplane absolute winning property of weighted inhomogeneous badly approximable vectors in $\mathbb{R}^d$. This answers a question by Beresnevich--Nesharim--Yang and extends the main result of [Geometric and Functional…

Approximation in this paper is of vectors on the unit $d$-cube by the projection of integer lattice points onto the same cube. We define badly approximable vectors on a rational quadratic variety and show that sets of these vectors, which…

We show that badly approximable vectors are exactly those that cannot, for any inhomogeneous parameter, be inhomogeneously approximated at every monotone divergent rate. This implies in particular that Kurzweil's Theorem cannot be…

Consider irrational affine subspace $ A\subset \mathbb{R}^d$ of dimension $a$. We prove that the set $$ \{\xi =(\xi_1,...,\xi_d) \in {A}:\,\,\, \ q^{1/a}\cdot \max_{1\le i \le d} ||q\xi_i|| \to \infty,\,\,\,\, q\to \infty\} $$ is an…

For any i,j>0 with i+j =1, let Bad(i,j) denote the set of points (x,y) \in R^2 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…

We prove that the countable intersection of $C^1$-diffeomorphic images of certain Diophantine sets has full Hausdorff dimension. For example, we show this for the set of badly approximable vectors in $\mathbb{R}^d$, improving earlier…

We prove that for any pair $(s,t)$ of nonnegative numbers with $s+t=1$, the set of two-dimensional $(s,t)$-badly approximable vectors is winning for Schmidt's game. As a consequence, we give a direct proof of Schmidt's conjecture using his…

Something is definitely wrong. If the game has a linear winning strategy, then it is tractable. What's going on? Well, we describe a two-person game which has a definite winner, that is, a player who can force a win in a finite number of…

We explore and refine techniques for estimating the Hausdorff dimension of exceptional sets and their diffeomorphic images. Specifically, we use a variant of Schmidt's game to deduce the strong C^1 incompressibility of the set of badly…

We show that points on $C^{1}$ curves which are badly approximable by rationals in a number field form a winning set in the sense of W. M. Schmidt. As a consequence, we obtain a number field version of Schmidt's conjecture.

In a beta-transformation (for integer beta) or a Gauss map system, given a sequence of functions fn from [0,1] to itself, consider the collection of points in [0,1] whose nth iteration under the map is distanced away from its value under…

We construct non-isomorphic models M, N, e.g. of cardinality aleph_1 such that in the Ehrenfeucht-Fraisse game of length zeta < omega_1 the isomorphism player wins

We consider approximation of vectors $\mathbf{z}\in F\otimes\mathbb{R}\cong\mathbb{R}^r\times\mathbb{C}^s$ by elements of a number field $F$ and construct examples of badly approximable vectors. These examples come from compact subspaces of…

We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…

Can an absorbing game with rational data have an irrational limit value? Yes: In this note we provide the simplest examples where this phenomenon arises. That is, the following $3\times 3$ absorbing game \[ A = \begin{bmatrix} 1^* & 1^* &…

For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max…