Related papers: Distance sets bounds for polyhedral norms via effe…

We obtain the exact value of the Hausdorff dimension of the set of coefficients of Gauss sums which for a given $\alpha \in (1/2,1)$ achieve the order at least $N^{\alpha}$ for infinitely many sum lengths $N$. For Weyl sums with polynomials…

In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…

Let $1 \leq k \leq d$ and consider a subset $E\subset \mathbb{R}^d$. In this paper, we study the problem of how large the Hausdorff dimension of $E$ must be in order for the set of distinct noncongruent $k$-simplices in $E$ (that is,…

This paper extends the problem of 2-dimensional palindrome search into the area of approximate matching. Using the Hamming distance as the measure, we search for 2D palindromes that allow up to $k$ mismatches. We consider two different…

The set of badly approximable numbers, Bad, is known to be winning for Schmidt's game and hence has full Hausdorff dimension. It is also known that the set of inhomogeneously badly approximable numbers has full dimension. We prove that the…

We prove estimates for the variation of the eigenvalues of uniformly elliptic operators with homogeneous Dirichlet or Neumann boundary conditions upon variation of the open set on which an operator is defined. We consider operators of…

We prove a monotonicity formula for minimal or almost minimal sets for the Hausdorff measure $\cal{H}^d$, subject to a sliding boundary constraint where competitors for $E$ are obtained by deforming $E$ by a one-parameter family of…

We consider linear mappings on the $d$-dimensional torus, defined by $T(x) = Ax \pmod 1$, where $A$ is an invertible $d \times d$ integer matrix, with no eigenvalues on the unit circle. In the case $d = 2$ and $\det A = \pm 1$, we give a…

Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…

This paper has been withdrawn Any real number $x$ in the unit interval can be expressed as a continued fraction $x=[n_1,...,n_{_N},...]$. Subsets of zero measure are obtained by imposing simple conditions on the $n_{_N}$. By imposing…

We show that there exists an absolute positive constant $b (\geq \frac{1}{48})$ so that any set of $n$ points in $\mathbb{R}^d$ that is $d$-dimensional determines at least $bdn$ lines with pairwise distinct directions. As a consequence we…

The point-to-set principle \cite{LutLut17} characterizes the Hausdorff dimension of a subset $E\subseteq\R^n$ by the \textit{effective} (or algorithmic) dimension of its individual points. This characterization has been used to prove…

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…

Let $s \in [0,1]$. We show that a Borel set $N \subset \mathbb{R}^{2}$ whose every point is linearly accessible by an $s$-dimensional family of lines has Hausdorff dimension at most $2 - s$.

In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…

The Hausdorff dimension of a set can be detected using the Riesz energy. Here, we consider situations where a sequence of points, $\{x_n\}$, ``fills in'' a set $E \subset \mathbb{R}^d$ in an appropriate sense and investigate the degree to…

Let $X$ be a finite-dimensional normed space and let $Y \subseteq X$ be its proper linear subspace. The set of all minimal projections from $X$ to $Y$ is a convex subset of the space all linear operators from $X$ to $X$ and we can consider…

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…