Related papers: Dimension bound for badly approximable grids
The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…
We prove that a metric measure space $(X,d,m)$ satisfying finite dimensional lower Ricci curvature bounds and whose Sobolev space $W^{1,2}$ is Hilbert is rectifiable. That is, a $RCD^*(K,N)$-space is rectifiable, and in particular for…
The unit-distance graph on the $n$-dimensional integer lattice $\mathbb{Z}^n$ is called the $n$-dimensional grid. We attempt to maximize the girth of a $k$-regular (possibly induced) subgraph of the $n$-dimensional grid, and provide…
We discuss entropy bounds for a class of two-dimensional gravity models. While the Bekenstein bound can be proved to hold in general for weakly gravitating matter, the analogous of the holographic bound is not universal, but depends on the…
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…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…
We show that badly approximable vectors are exactly those that cannot, for any inhomogeneous parameter, be inhomogeneously approximated at every monotone divergent rate. This implies in particular that Kurzweil's Theorem cannot be…
Recently there has been a lot of interest in models in which gravity becomes strong at the TeV scale. The observed weakness of gravitational interactions is then explained by the existence of extra compact dimensions of space, which are…
We introduce a variation of metric dimension, called the multiset dimension. The representation multiset of a vertex $v$ with respect to $W$ (which is a subset of the vertex set of a graph $G$), $r_m (v|W)$, is defined as a multiset of…
We show that under minimal assumptions on a class of functions $\mathcal{H}$ defined on a probability space $(\mathcal{X},\mu)$, there is a threshold $\Delta_0$ satisfying the following: for every $\Delta\geq\Delta_0$, with probability at…
We establish a new version of Siegel's lemma over a number field $k$, providing a bound on the maximum of heights of basis vectors of a subspace of $k^N$, $N \geq 2$. In addition to the small-height property, the basis vectors we obtain…
The quantum relative entropy $S(\rho||\sigma)$ is a widely used dissimilarity measure between quantum states, but it has the peculiarity of being asymmetric in its arguments. We quantify the amount of asymmetry by providing a sharp upper…
A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales. When the resource bound \Delta (a parameter of the theory) is unrestricted, the resulting dimension is precisely the…
The orthogonality dimension of a graph $G$ over $\mathbb{R}$ is the smallest integer $k$ for which one can assign a nonzero $k$-dimensional real vector to each vertex of $G$, such that every two adjacent vertices receive orthogonal vectors.…
In this paper, we investigate bounds for the following judicious $k$-partitioning problem: Given an edge-weighted graph $G$, find a $k$-partition $(V_1,V_2,\dots ,V_k)$ of $V(G)$ such that the total weight of edges in the heaviest induced…
The set of badly approximable $m \times n $ matrices is known to have Hausdorff dimension $mn $. Each such matrix comes with its own approximation constant $c$, and one can ask for the dimension of the set of badly approximable matrices…
We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…
Let $\epsilon_{1},\ldots,\epsilon_{n}$ be a sequence of independent Rademacher random variables. We prove that there is a constant $c>0$ such that for any unit vectors $v_1,\ldots,v_n\in \mathbb{R}^2$, $$\Pr\left[||\epsilon_1…
We consider integer programming problems in standard form $\max \{c^Tx : Ax = b, \, x\geq 0, \, x \in Z^n\}$ where $A \in Z^{m \times n}$, $b \in Z^m$ and $c \in Z^n$. We show that such an integer program can be solved in time $(m…