Related papers: Shrinking targets and eventually always hitting po…
We study the problem of regression with interval targets, where only upper and lower bounds on target values are available in the form of intervals. This problem arises when the exact target label is expensive or impossible to obtain, due…
Let $T$ be a $d\times d$ matrix with real coefficients. Then $T$ determines a self-map of the $d$-dimensional torus ${\Bbb T}^d={\mathbb{R}}^d/{\Bbb Z}^d$. Let $ \{E_n \}_{n \in \mathbb{N}} $ be a sequence of subsets of ${\Bbb T}^d$ and let…
Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriously hard both in the…
A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…
Let $\mathcal{A}$ and $\mathcal{B}$ be unital finite-dimensional complex algebras, each equipped with the unique Hausdorff vector topology. Denote by $\mathrm{Max}(\mathcal{A})=\{\mathcal{M}_1, \ldots, \mathcal{M}_p\}$ and…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
In this paper, we study the problem of map matching with travel time constraints. Given a sequence of $k$ spatio-temporal measurements and an embedded path graph with travel time costs, the goal is to snap each measurement to a close-by…
In 1995, Hill and Velani introduced the shrinking targets theory. Given a dynamical system $([0,1],T)$, they investigated the Hausdorff dimension of sets of points whose orbits are close to some fixed point. In this paper, we study the sets…
We consider expanding systems with invariant measures that are uniformly expanding everywhere except on a small measure set and show that the limiting statistics of hitting times for zero measure sets are compound Poisson provided the…
We consider the discrete shrinking target problem for Teichm\"uller geodesic flow on the moduli space of abelian or quadratic differentials and prove that the discrete geodesic trajectory of almost every differential will hit a shrinking…
We study Manneville-Pomeau maps on the unit interval and prove that the set of points whose forward orbits miss an interval with left endpoint 0 is strong winning for Schmidt's game. Strong winning sets are dense, have full Hausdorff…
We study a random matching problem on closed compact $2$-dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
In this paper, we study the shrinking-target problem with target at infinity induced by the injectivity radius function under the action of a regular diagonalizable flow on $\operatorname{SL}_3(\mathbb R)/\operatorname{SL}_3(\mathbb Z)$. In…
This paper defines and describes a few (related) notions of shrinking target property. We show that simultaneous expanding circle maps have a certain shrinking target property, but that circle homeomorphisms and isometries of complete,…
In one-dimensional Diophantine approximation, the Diophantine properties of a real number are characterized by its partial quotients, especially the growth of its large partial quotients. Notably, Kleinbock and Wadleigh [Proc. Amer. Math.…
In this paper, we study the many-to-many matching problem on planar point sets with integer coordinates: Given two disjoint sets $R,B \subset [\Delta]^2$ with $|R|+|B|=n$, the goal is to select a set of edges between $R$ and $B$ so that…
In the study of some dynamical systems the limsup set of a sequence of measurable sets is often of interest. The shrinking targets and recurrence are two of the most commonly studied problems that concern limsup sets. However, the zero-one…
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. This paper deals with finding perfect matchings, spanning trees, or…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…