arXiv subjects

Lior Fishman

Publications and source records attributed to Lior Fishman.

At least 19 recordsLinked to original sources

arXiv2026

Schmidt's Game and Vitali Sets

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 construct a Vitali set which is $(\alpha, \beta)$-winning, while for other values of $\alpha,\beta$ every Vitali set is $(\alpha,\beta)$-losing. We also investigate the $(\alpha,\beta)$-Schmidt game for various other types of pathological sets, highlighting their differences from Vitali sets.

math.LO↗

arXiv2025

Diophantine approximation on abelian varieties; a conjecture of M. Waldschmidt

Following the work of Waldschmidt, we investigate problems in Diophantine approximation on abelian varieties. First we show that a conjecture of Waldschmidt for a given simple abelian variety is equivalent to a well-known Diophantine condition holding for a certain matrix related to that variety. We then posit a related but weaker conjecture, and establish the upper bound direction of that conjecture in full generality. For rank 1 elliptic curves defined over a number field $K \subset \mathbb{R}$, we then obtain a weak-type Dirichlet theorem in this setting, establish the optimality of this statement, and prove our conjecture in this case.

math.NT↗

arXiv2023

Intersection Games and Bernstein Sets

The Banach-Mazur game, Schmidt's game and McMullen's absolute winning game are three quintessential intersection games. We investigate their determinacy on the real line when the target set for either player is a Bernstein set, a non-Lebesgue measurable set whose construction depends on the axiom of choice.

math.LO↗

arXiv2021

The no-$\beta$ McMullen game and the perfect set property

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 consider the version of this game in which the parameter $\beta$ is removed, which we call the no-$\beta$ McMullen game. More generally, we consider the game with respect to arbitrary norms on $\mathbb{R}^d$, and even more generally with respect to general convex sets. We show that for strictly convex sets in $\mathbb{R}^d$, polytopes in $\mathbb{R}^d$, and general convex sets in $\mathbb{R}^2$, that player $\boldsymbol{I}$ wins the no-$\beta$ McMullen game iff $A$ contains a perfect set and player $\boldsymbol{I}\kern-0.05cm\boldsymbol{I}$ wins iff $A$ is countable. So, the no-$\beta$ McMullen game is equivalent to the perfect set game for $A$ in these cases. The proofs of these results use a connection between the geometry of the game and techniques from logic. Because of the geometry of this game, this result has strong implications for the geometry of uncountable sets in $\mathbb{R}^d$. We also present an example of a compact, convex set in $\mathbb{R}^3$ to which our methods do not apply, and also an example due to D.\ Simmons of a closed, convex set in $\ell_2(\mathbb{R})$ which illustrate the obstacles in extending the results further.

math.LO↗

arXiv2020

Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism

We consider small perturbations of a conformal iterated function system (CIFS) produced by either adding or removing some generators with small derivative from the original. We establish a formula, utilizing transfer operators arising from the thermodynamic formalism \`a la Sinai--Ruelle--Bowen, which may be solved to express the Hausdorff dimension of the perturbed limit set in series form: either exactly, or as an asymptotic expansion. Significant applications include strengthening Hensley's asymptotic formula from 1992, which improved on earlier bounds due to Jarn\'ik and Kurzweil, for the Hausdorff dimension of the set of real numbers whose continued fraction expansion partial quotients are all $\leq N$; as well as its counterpart for reals whose partial quotients are all $\geq N$ due to Good from 1941.

math.DS↗

arXiv2020

Hausdorff Dimension Regularity Properties and Games

The Hausdorff $δ$-dimension game was introduced by Das, Fishman, Simmons and {Urba{ń}ski} and shown to characterize sets in $\mathbb{R}^d$ having Hausdorff dimension $\leq δ$. We introduce a variation of this game which also characterizes Hausdorff dimension and for which we are able to prove an unfolding result similar to the basic unfolding property for the Banach-Mazur game for category. We use this to derive a number of consequences for Hausdorff dimension. We show that under $\mathsf{AD}$ any wellordered union of sets each of which has Hausdorff dimension $\leq δ$ has dimension $\leq δ$. We establish a continuous uniformization result for Hausdorff dimension. The unfolded game also provides a new proof that every $\boldsymbolΣ^1_1$ set of Hausdorff dimension $\geq δ$ contains a compact subset of dimension $\geq δ'$ for any $δ'<δ$, and this result generalizes to arbitrary sets under $\mathsf{AD}$.

math.LO↗

arXiv2020

Equivalence Relations and Determinacy

We introduce the notion of $(Γ,E)$-determinacy for $Γ$ a pointclass and $E$ an equivalence relation on a Polish space $X$. A case of particular interest is the case when $E=E_G$ is the (left) shift-action of $G$ on $S^G$ where $S=2=\{0,1\}$ or $S=ω$. We show that for all shift actions by countable groups $G$, and any "reasonable" pointclass $Γ$, that $(Γ,E_G)$-determinacy implies $Γ$-determinacy. We also prove a corresponding result when $E$ is a subshift of finite type of the shift map on $2^\mathbb{Z}$.

math.LO↗

arXiv2019

The Measure Game

We study a game first introduced by Martin (actually we use a slight variation of this game) which plays a role for measure analogous to the Banach-Mazur game for category. We first present proofs for the basic connections between this game and measure, and then use the game to prove fundamental measure theoretic results such as Fubini's theorem, the Borel-Cantelli lemma, and a general unfolding result for the game which gives, for example, the measurability of $\boldsymbolΣ^1_1$ sets. We also use the game to give a new, more constructive, proof of a strong form of the Rényi-Lamperti lemma, an important result in probability theory with many applications to number theory. The proofs we give are all direct combinatorial arguments using the game, and do not depend on known measure theoretic arguments.

math.LO↗

arXiv2019

A variational principle in the parametric geometry of numbers

We extend the parametric geometry of numbers (initiated by Schmidt and Summerer, and deepened by Roy) to Diophantine approximation for systems of $m$ linear forms in $n$ variables, and establish a new connection to the metric theory via a variational principle that computes fractal dimensions of a variety of sets of number-theoretic interest. The proof relies on two novel ingredients: a variant of Schmidt's game capable of computing the Hausdorff and packing dimensions of any set, and the notion of templates, which generalize Roy's rigid systems. In particular, we compute the Hausdorff and packing dimensions of the set of singular systems of linear forms and show they are equal, resolving a conjecture of Kadyrov, Kleinbock, Lindenstrauss and Margulis, as well as a question of Bugeaud, Cheung and Chevallier. As a corollary of Dani's correspondence principle, the divergent trajectories of a one-parameter diagonal action on the space of unimodular lattices with exactly two Lyapunov exponents with opposite signs has equal Hausdorff and packing dimensions. Other applications include quantitative strengthenings of theorems due to Cheung and Moshchevitin, which originally resolved conjectures due to Starkov and Schmidt respectively; as well as dimension formulas with respect to the uniform exponent of irrationality for simultaneous and dual approximation in two dimensions, completing partial results due to Baker, Bugeaud, Cheung, Chevallier, Dodson, Laurent and Rynne.

math.NT↗

arXiv2018

Schmidt's game, fractals, and orbits of toral endomorphisms

Given an integer nonsingular $n\times n$ matrix $M$ and a point $y \in \mathbb{R}^n/\mathbb{Z}^n$, consider the set $\tilde E(M,y)$ of vectors $x\in \mathbb{R}^n$ such that $y$ is not a limit point of the sequence $\{M^k x \mod \mathbb{Z}^n: k\in\mathbb{N}\}$. S.G. Dani showed in 1988 that whenever $M$ is semisimple and $y \in \mathbb{Q}^n/\mathbb{Z}^n$, the set $\tilde E(M,y)$ has full Hausdorff dimension. In this paper we strengthen this result, extending it to arbitrary $y \in \mathbb{R}^n/\mathbb{Z}^n$ and integer nonsingular $M$, and in fact replacing the sequence of powers of $M$ by any lacunary sequence of (not necessarily integer) $m\times n$ matrices. Furthermore, we show that sets of the form $\tilde E(M,y)$ and their generalizations always intersect with `sufficiently regular' fractal subsets of $\mathbb{R}^n$. As an application we give an alternative proof of a recent result of Einsiedler and Tseng on badly approximable systems of affine forms.

math.DS↗

arXiv2018

Schmidt's game, fractals, and numbers normal to no base

Given $b > 1$ and $y \in \mathbb{R}/\mathbb{Z}$, we consider the set of $x\in \mathbb{R}$ such that $y$ is not a limit point of the sequence $\{b^n x \bmod 1: n\in\mathbb{N}\}$. Such sets are known to have full Hausdorff dimension, and in many cases have been shown to have a stronger property of being winning in the sense of Schmidt. In this paper, by utilizing Schmidt games, we prove that these sets and their bi-Lipschitz images must intersect with `sufficiently regular' fractals $K\subset \mathbb{R}$ (that is, supporting measures $μ$ satisfying certain decay conditions). Furthermore, the intersection has full dimension in $K$ if $μ$ satisfies a power law (this holds for example if $K$ is the middle third Cantor set). Thus it follows that the set of numbers in the middle third Cantor set which are normal to no base has dimension $\log2/\log3$.

math.DS↗

arXiv2018

Equivalence of the Rothberger and $2$-Rothberger Games for Hausdorff Spaces

We prove that in any Hausdorff space, the Rothberger game is equivalent to the $k$-Rothberger game, i.e. the game in which player II chooses $k$ open sets in each move. This result follows from a more general theorem in which we show these games are equivalent to a game we call the restricted Menger game. In this game I knows immediately in advance of playing each open cover how many open sets II will choose from that open cover. This result illuminates the relationship between the Rothberger and Menger games in Hausdorff spaces. The equivalence of these games answers a question posed by Aurichi, Bella, and Dias, at least in the context of Hausdorff spaces.

math.GN↗

arXiv2017

Determinacy of Schmidt's Game and Other Intersection Games

Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the players make moves from a complete separable metric space. The determinacy of these games trivially follows from the axiom of determinacy for real games, $\mathsf{AD}_\mathbb{R}$, which is a much stronger axiom than that asserting all integer games are determined, $\mathsf{AD}$. One of our main results is a general theorem which under the hypothesis $\mathsf{AD}$ implies the determinacy of intersection games which have a property allowing strategies to be simplified. In particular, we show that Schmidt's $(α,β,ρ)$ game on $\mathbb{R}$ is determined from $\mathsf{AD}$ alone, but on $\mathbb{R}^n$ for $n \geq 3$ we show that $\mathsf{AD}$ does not imply the determinacy of this game. We also prove several other results specifically related to the determinacy of Schmidt's game. These results highlight the obstacles in obtaining the determinacy of Schmidt's game from $\mathsf{AD}$.

math.LO↗

arXiv2017

Hausdorff dimensions of very well intrinsically approximable subsets of quadratic hypersurfaces

We prove an analogue of a theorem of A. Pollington and S. Velani ('05), furnishing an upper bound on the Hausdorff dimension of certain subsets of the set of very well intrinsically approximable points on a quadratic hypersurface. The proof incorporates the framework of intrinsic approximation on such hypersurfaces first developed in the authors' joint work with D. Kleinbock (preprint '14) with ideas from work of D. Kleinbock, E. Lindenstrauss, and B. Weiss ('04).

math.NT↗

arXiv2017

Quantitative results using variants of Schmidt's game: Dimension bounds, arithmetic progressions, and more

Schmidt's game is generally used to deduce qualitative information about the Hausdorff dimensions of fractal sets and their intersections. However, one can also ask about quantitative versions of the properties of winning sets. In this paper we show that such quantitative information has applications to various questions including: * What is the maximal length of an arithmetic progression on the "middle $ε$" Cantor set? * What is the smallest $n$ such that there is some element of the ternary Cantor set whose continued fraction partial quotients are all $\leq n$? * What is the Hausdorff dimension of the set of $ε$-badly approximable numbers on the Cantor set? We show that a variant of Schmidt's game known as the $potential$ $game$ is capable of providing better bounds on the answers to these questions than the classical Schmidt's game. We also use the potential game to provide a new proof of an important lemma in the classical proof of the existence of Hall's Ray.

math.MG↗

arXiv2017

A variational principle in the parametric geometry of numbers, with applications to metric Diophantine approximation

We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest in Diophantine approximation. In particular, we show that the Hausdorff and packing dimensions of the set of singular $m\times n$ matrices are both equal to $mn \big(1-\frac1{m+n}\big)$, thus proving a conjecture of Kadyrov, Kleinbock, Lindenstrauss, and Margulis (preprint 2014) as well as answering a question of Bugeaud, Cheung, and Chevallier (preprint 2016). We introduce the notion of a $template$, which generalizes the notion of a $rigid$ $system$ (Roy, 2015) to the setting of matrix approximation. Our main theorem takes the following form: for any class of templates $\mathcal F$ closed under finite perturbations, the Hausdorff and packing dimensions of the set of matrices whose successive minima functions are members of $\mathcal F$ (up to finite perturbation) can be written as the suprema over $\mathcal F$ of certain natural functions on the space of templates. Besides implying KKLM's conjecture, this theorem has many other applications including computing the Hausdorff and packing dimensions of the set of points witnessing a conjecture of Starkov (2000), and of the set of points witnessing a conjecture of Schmidt (1983).

math.NT↗

arXiv2017

Badly approximable points on self-affine sponges and the lower Assouad dimension

We highlight a connection between Diophantine approximation and the lower Assouad dimension by using information about the latter to show that the Hausdorff dimension of the set of badly approximable points that lie in certain non-conformal fractals, known as self-affine sponges, is bounded below by the dynamical dimension of these fractals. In particular, for self-affine sponges with equal Hausdorff and dynamical dimensions, the set of badly approximable points has full Hausdorff dimension in the sponge. Our results, which are the first to advance beyond the conformal setting, encompass both the case of Sierpiński sponges/carpets (also known as Bedford-McMullen sponges/carpets) and the case of Barański carpets. We use the fact that the lower Assouad dimension of a hyperplane diffuse set constitutes a lower bound for the Hausdorff dimension of the set of badly approximable points in that set.

math.DS↗

arXiv2017

Extremality and dynamically defined measures, part I: Diophantine properties of quasi-decaying measures

We present a new method of proving the Diophantine extremality of various dynamically defined measures, vastly expanding the class of measures known to be extremal. This generalizes and improves the celebrated theorem of Kleinbock and Margulis ('98) resolving Sprindžuk's conjecture, as well as its extension by Kleinbock, Lindenstrauss, and Weiss ('04), hereafter abbreviated KLW. As applications we prove the extremality of all hyperbolic measures of smooth dynamical systems with sufficiently large Hausdorff dimension, and of the Patterson--Sullivan measures of all nonplanar geometrically finite groups. The key technical idea, which has led to a plethora of new applications, is a significant weakening of KLW's sufficient conditions for extremality. In Part I, we introduce and develop a systematic account of two classes of measures, which we call $quasi$-$decaying$ and $weakly$ $quasi$-$decaying$. We prove that weak quasi-decay implies strong extremality in the matrix approximation framework (which has received much attention in recent years), thus proving a conjecture of KLW. We also prove the "inherited exponent of irrationality" version of this theorem, describing the relationship between the Diophantine properties of certain subspaces of the space of matrices and measures supported on these subspaces. In subsequent papers, we exhibit numerous examples of quasi-decaying measures, in support of the thesis that "almost any measure from dynamics and/or fractal geometry is quasi-decaying". In addition to the examples described above, we also prove (for example) that Gibbs measures (including conformal measures) of infinite iterated function systems are quasi-decaying, even if the systems in question do not satisfy the open set condition. We also discuss examples of non-extremal measures coming from dynamics, illustrating where the theory must halt.

math.DS↗