Related papers: Projection Theorems Using Effective Dimension
In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways. 1. We prove a point-to-set…
In this article we prove martingale type pointwise convergence theorems pertaining to tensor product splines defined on $d$-dimensional Euclidean space ($d$ is a positive integer), where conditional expectations are replaced by their…
We develop a versatile framework which allows us to rigorously estimate the Hausdorff dimension of maximal conformal graph directed Markov systems in $\mathbb{R}^n$ for $n \geq 2$. Our method is based on piecewise linear approximations of…
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclidean distance between points up to a bounded relative error.…
We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…
The proof of the theorem, which states that the Euclidean metric on the set of random points in an $n$-dimensional Euclidean space with the distribution of a special class, converges in probability in the limit $n\rightarrow\infty$ to the…
Let $E \subseteq \mathbb{R}^n$ be a union of line segments and $F \subseteq \mathbb{R}^n$ the set obtained from $E$ by extending each line segment in $E$ to a full line. Keleti's line segment extension conjecture posits that the Hausdorff…
For any $x\in\mathbb{R}^d$, $d\geq 2$, denote $\pi^x: \mathbb{R}^d\backslash\{x\}\rightarrow S^{d-1}$ as the radial projection $$\pi^x(y)=\frac{y-x}{|y-x|}. $$ Given a Borel set $E\subset{\Bbb R}^d$, $\dim_{\mathcal{H}} E\leq d-1$, in this…
The Besicovitch projection theorem states that if a subset $E$ of the plane has finite length in the sense of Hausdorff measure and is purely unrectifiable (so its intersection with any Lipschitz graph has zero length), then almost every…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
We study the fractal pointwise convergence for the equation $i\hbar\partial_tu + P(D)u = 0$, where the symbol $P$ is real, homogeneous and non-singular. We prove that for initial data $f\in H^s(\mathbb{R}^n)$ with $s>(n-\alpha+1)/2$ the…
This paper develops an efficient algorithm for computing the Euclidean projection onto the top-k-sum constraint, a key operation in financial risk management and matrix optimization problems. Existing projection methods rely on sorting and…
An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
This paper investigates the algorithmic dimension spectra of lines in the Euclidean plane. Given any line L with slope a and vertical intercept b, the dimension spectrum sp(L) is the set of all effective Hausdorff dimensions of individual…
We construct a theory of fields living on continuous geometries with fractional Hausdorff and spectral dimensions, focussing on a flat background analogous to Minkowski spacetime. After reviewing the properties of fractional spaces with…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
Let $T$ be a finitely branching rooted tree such that any node has at least two successors. The path space $[T]$ is an ultrametric space: for distinct paths $f,g$ let $d(f,g)= 1/|T_n|$, where $T_n$ denotes the $n$-th level of the tree, and…
To understand the structure of an algebraic variety we often embed it in various projective spaces. This develops the notion of projective geometry which has been an invaluable tool in algebraic geometry. We develop a perfectoid analog of…