Related papers: Rectangular Shrinking Targets on Self-Similar Carp…
We study the problem of finding the global Riemannian center of mass of a set of data points on a Riemannian manifold. Specifically, we investigate the convergence of constant step-size gradient descent algorithms for solving this problem.…
For a map $T \colon [0,1] \to [0,1]$ with an invariant measure $\mu$, we study, for a $\mu$-typical $x$, the set of points $y$ such that the inequality $|T^n x - y| < r_n$ is satisfied for infinitely many $n$. We give a formula for the…
We compute the Hausdorff dimension of the set of $\psi$-exactly approximable vectors, in the simultaneous case, in dimension strictly larger than $2$ and for approximating functions $\psi$ with order at infinity less than or equal to $-2$.…
We construct a family of planar self-affine carpets with overlaps using lower triangular matrices in a way that generalizes the original Gatzouras--Lalley carpets defined by diagonal matrices. Assuming the rectangular open set condition,…
The notions of unimodular Minkowski and Hausdorff dimensions are defined in [arXiv:1807.02980] for unimodular random discrete metric spaces. The present paper is focused on the connections between these notions and the polynomial growth…
The Separating Hyperplane theorem is a fundamental result in Convex Geometry with myriad applications. Our first result, Random Separating Hyperplane Theorem (RSH), is a strengthening of this for polytopes. $\rsh$ asserts that if the…
Hausdorff and box dimension are two familiar notions of fractal dimension. Box dimension can be larger than Hausdorff dimension, because in the definition of box dimension, all sets in the cover have the same diameter, but for Hausdorff…
The connections between quasi-Assouad dimension and tangents are studied. We apply these results to the calculation of the quasi-Assouad dimension for a class of planar self-affine sets. We also show that sets with decreasing gaps have…
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…
The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…
For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…
The Wang-Landau algorithm aims at sampling from a probability distribution, while penalizing some regions of the state space and favoring others. It is widely used, but its convergence properties are still unknown. We show that for some…
We investigate an inverse scattering problem for a thin inhomogeneous scatterer in R^m, m = 2,3, which we model as a m-1 dimensional open surface. The scatterer is referred to as a screen. The goal is to design target signatures that are…
Given a non-increasing function $\psi\colon\mathbb{N}\to\mathbb{R}^+$ such that $s^{\frac{n+1}{n}}\psi(s)$ tends to zero as $s$ goes to infinity, we show that the set of points in $\mathbb{R}^n$ that are exactly $\psi$-approximable is…
In this paper we prove some lower bounds on the Hausdorff dimension of sets of Furstenberg type. Moreover, we extend these results to sets of generalized Furstenberg type, associated to doubling dimension functions. With some additional…
Starting from a sigma-model for a doubled target-space geometry, we show that the number of target-space dimensions can be reduced by half through a gauging procedure. We apply this formalism to a class of backgrounds relevant for double…
The use of Hausdorff measures and dimension in the theory of Diophantine approximation dates back to the 1920s with the theorems of Jarnik and Besicovitch regarding well-approximable and badly-approximable points. In this paper we consider…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
For given $\epsilon>0$ and $b\in\mathbb{R}^m$, we say that a real $m\times n$ matrix $A$ is $\epsilon$-badly approximable for the target $b$ if $$\liminf_{q\in\mathbb{Z}^n, \|q\|\to\infty} \|q\|^n \langle Aq-b \rangle^m \geq \epsilon,$$…
This paper proves shrinking target results for IETs. Let {a_1\geq a_2 \geq...} be a sequence of positive real numbers with divergent sum. Then for almost every IET T, the limsup of B(T^ix,a_i) has full Lebesgue measure (where B(z, e) is the…