SearcharxivSearch

arXiv subjects

Iqra Altaf

Publications and source records attributed to Iqra Altaf.

6 recordsLinked to original sources

On the packing dimension of distance sets with respect to $C^1$ and polyhedral norms

We prove that, for every polyhedral or $C^1$ norm on $\mathbb{R}^d$ and every set $E \subseteq \mathbb{R}^d$ of packing dimension $s$, the packing dimension of the distance set of $E$ with respect to that norm is at least $\tfrac{s}{d}$. One of the main tools is a nonlinear projection theorem extending a result of M. J\"{a}rvenp\"{a}\"{a}. An explicit construction follows, demonstrating that these distance sets bounds are sharp for a large class of polyhedral norms.

math.CA

On the modulus of continuity of functions whose image has positive measure, and metric embeddings into $\mathbb{R}^d$ without shrinking

A generalization of the classical Sard theorem in the plane is the following. Let $f$ be a function defined on a subset $A\subset{\mathbb R}^2$. If $f$ has modulus of continuity $\omega(r)\lesssim r^2$, then $f(A)\subset{\mathbb R}$ has Lebesgue measure zero. Choquet claimed in \cite{Choquet} that this was a full characterization, i.e. for every $\omega$ for which $\omega(r)/r^2$ converges to $\infty$ as $r\to 0$, there is a counterexample. We disprove this by showing that the correct characterization, in $\mathbb{R}^d$, is $\int_{0}^{1} \omega(r)^{-1/d}=\infty$. For the precise statement see Theorem 2. We obtain this as a special case of a more general result. We study which spaces $(X,\rho)$ can be embedded into ${\mathbb R}^d$ without decreasing any of the distances in $X$. That is, we ask the question whether there is an $f: X\to {\mathbb R}^d$ such that $\|f(x)-f(y)\|\ge \rho(x,y)$ for every $x,y\in X$. We study this problem for some very general distance functions $\rho$ (we do not even assume that it is a metric space, in particular, we do not assume that $\rho$ satisfies the triangle inequality), and find quantitative necessary and sufficient conditions under which such a mapping exists. We will obtain the characterization mentioned above as a special case of our metric embedding results, by choosing $X$ to be an interval in $\mathbb{R}$, and defining $\rho$ by putting $\rho(x,y)=r$ if $\|x-y\|=\omega(r)$.

math.CA

A one-dimensional planar Besicovitch-type set

A $\Gamma$-Besicovitch set is a set which contains a rotated copy of $\Gamma$ in every direction. Our main result is the construction of a non-trivial $1$-rectifiable set $\Gamma$ in the plane, for which there exists a 1-dimensional $\Gamma$-Besicovitch set.

math.CA

Hausdorff dimension of Besicovitch sets of Cantor graphs

We consider the Hausdorff dimension of planar Besicovitch sets for rectifiable sets $Γ$, i.e. sets that contain a rotated copy of $Γ$ in each direction. We show that for a large class of Cantor sets $C$ and Cantor-graphs $Γ$ built on $C$, the Hausdorff dimension of any $Γ$-Besicovitch set must be at least $\min\left(2-s^2,\frac{1}{s}\right)$, where $s=\dim C$.

math.MG

Distance sets bounds for polyhedral norms via effective dimension

We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows, demonstrating that this bound is sharp for every polyhedral norm on $\mathbb{R}^d$. The techniques of algorithmic complexity theory underlie both the computations and the construction.

math.CA

Scaled Oscillation and Level Sets

We study the size and regularity properties of level sets of continuous functions with bounded upper-scaled and lower-scaled oscillation.

math.CA