Related papers: Dimension bound for badly approximable grids

We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…

We establish an epsilon-regularity theorem at points in the free boundary of almost-minimizers of the energy $\mathrm{Per}_{w}(E)=\int_{\partial^*E}w\,\mathrm{d} {\mathscr{H}}^{n-1}$, where $w$ is a weight asymptotic to…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

In 2015, Dankelmann and Bau proved that for every bridgeless graph $G$ of order $n$ and minimum degree $\delta$ there is an orientation of diameter at most $11\frac{n}{\delta+1}+9$. In 2016, Surmacs reduced this bound to…

We study Erd\H os's distinct distances problem under $\ell_p$ metrics with integer $p$. We improve the current best bound for this problem from $\Omega(n^{4/5})$ to $\Omega(n^{6/7-\epsilon})$, for any $\epsilon>0$. We also characterize the…

This note is the third part of our work devoted to uniqueness sets for spaces of entire functions. Given a discrete set $\Lambda$ with angular density $\Delta$ with respect to the order $\rho$, satisfying some regularity condition, we show…

Let $\mathcal{K}$ be a discrete valued field with finite residue field. In analogy with orthogonality in the Euclidean space $\mathbb{R}^n$, there is a well-studied notion of "ultrametric orthogonality" in $\mathcal{K}^n$. In this paper,…

Let Y^n denote the Gromov-Hausdorff limit of a sequence M^n_i-> Y^n of v-noncollapsed riemannian manifolds with Ric_i\geq-(n-1). The singular set S of Y has a stratification S^0\subset S^1\subset\...\subset S, where y\in S^k if no tangent…

Let $G$ be a connected graph. The Steiner distance $d(S)$ of a set $S$ of vertices is the minimum size of a connected subgraph of $G$ containing all vertices of $S$. For $k\in \mathbb{N}$, the Steiner $k$-Wiener index $SW_k(G)$ is defined…

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…

Let $\overrightarrow{v}\in\mathbb{R}^2\setminus\mathbb{Q}^2$, let $\lVert\cdot\lVert$ be an arbitrary norm on $\mathbb{R}^2$, and let $(q_n,\overrightarrow{p_n})_{n=0}^{\infty} \subset\mathbb{N}\times\mathbb{Z}^{2}$ be the best…

Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…

The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension…

We consider the relative configurational entropy per cell S_Delta as a measure of the degree of spatial disorder for systems of finite-sized objects. It is highly sensitive to deviations from the most spatially ordered reference…

The two-dimensional Levinson theorem for the Klein-Gordon equation with a cylindrically symmetric potential $V(r)$ is established. It is shown that $N_{m}\pi=\pi (n_{m}^{+}-n_{m}^{-})= [\delta_{m}(M)+\beta_{1}]-[\delta_{m}(-M)+\beta_{2}]$,…

We derive a lower bound on the smallest output entropy that can be achieved via vector quantization of a $d$-dimensional source with given expected $r$th-power distortion. Specialized to the one-dimensional case, and in the limit of…

Let $X$ be a set of $n$ points of norm at most $1$ in the Euclidean space $R^k$, and suppose $\varepsilon>0$. An $\varepsilon$-distance sketch for $X$ is a data structure that, given any two points of $X$ enables one to recover the square…

An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is…

Given $0 < s < 1$, I prove that there exists a constant $\epsilon = \epsilon(s) > 0$ such that the following holds. Let $K \subset \mathbb{R}^{2}$ be a Borel set with $\mathcal{H}^{1}(K) > 0$, and let $E_{s}(K) \subset S^{1}$ be the…

The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of…