Related papers: A lower bound on dimension reduction for trees in …

The critical behaviour of d-dimensional n-vector models at m-axial Lifshitz points is considered for general values of m in the large-n limit. It is proven that the recently obtained large-N expansions [J. Phys.: Condens. Matter 17, S1947…

A $(1+\varepsilon)\textit{-stretch tree cover}$ of a metric space is a collection of trees, where every pair of points has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated $\textit{Dumbbell Theorem}$ [Arya et~al.…

We prove that for $1\le k<d$, if $E$ is a Borel subset of $\mathbb{R}^d$ of Hausdorff dimension strictly larger than $k$, the set of $(k+1)$-volumes determined by $k+2$ points in $E$ has positive one-dimensional Lebesgue measure. In the…

We show that for $0<\gamma, \gamma' <1$ and for measurable subsets of the unit square with Lebesgue measure $\gamma$ there exist bi-Lipschitz maps with bounded Lipschitz constant (uniformly over all such sets) which are identity on the…

The rare semileptonic Bc-> D_s^* \ell^+ \ell^- decay is studied in the scenario of the universal extra dimension model with a single extra dimension in which inverse of the compactification radius R is the only new parameter. The…

We give a new proof that a star $\{op_i:i=1,...,k\}$ in a normed plane is a Steiner minimal tree of its vertices $\{o,p_1,...,p_k\}$ if and only if all angles formed by the edges at o are absorbing [Swanepoel, Networks \textbf{36} (2000),…

Given any complete Riemannian manifold $M$, we prove that for every $p \in (1, 2]$ and every $\epsilon > 0$, $$ \| \nabla f \|_p^2 \le C_\epsilon \| \Delta^{\frac{1}{2} + \epsilon} f \|_{p}\| \Delta^{\frac{1}{2} - \epsilon} f \|_{p}.$$The…

We show that if a closed manifold of dimension at least four admits a negatively curved metric that is almost Einstein in a suitable sense, then it admits a genuine Einstein metric of negative sectional curvature. Importantly, the pinching…

We prove that for all epsilon>0 there are c>0 and n_0 such that for all n>n_0 the following holds. For any two-colouring of the edges of $K_{n,n,n}$ one colour contains copies of all trees T of order t<(3-epsilon)n/2 and with maximum degree…

Fix a dimension $d\ge 2$, and let $T_n$ be a random $d$-dimensional determinantal hypertree on $n$ vertices. We prove that \[\frac{\log|H_{d-1}(T_n,\mathbb{Z})|}{{{n\choose {d}}}}\] converges in probability to a constant $c_d$, which…

Let $u$ be a harmonic function in the unit ball $B_1 \subset \mathbb R^n$, normalized so that its gradient has magnitude at most 1 on the unit ball. We show that if the gradient of $u$ is $\epsilon$-small in size on a set $E\subset B_{1/2}$…

We give an algorithm that computes a $(1+\epsilon)$-approximate Steiner forest in near-linear time $n \cdot 2^{(1/\epsilon)^{O(ddim^2)} (\log \log n)^2}$. This is a dramatic improvement upon the best previous result due to Chan et al., who…

The isotropy constant of any $d$-dimensional polytope with $n$ vertices is bounded by $C \sqrt{n/d}$ where $C>0$ is a numerical constant.

The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study the product dimension of forests, bounded treewidth graphs and…

The last decade brought a significant increase in the amount of data and a variety of new inference methods for reconstructing the detailed evolutionary history of various cancers. This brings the need of designing efficient procedures for…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Lightness and sparsity are two natural parameters for Euclidean $(1+\varepsilon)$-spanners. Classical results show that, when the dimension $d\in \mathbb{N}$ and $\varepsilon>0$ are constant, every set $S$ of $n$ points in $d$-space admits…

The recent breakthrough of Guth, Iosevich, Ou, and Wang (2019) on the Falconer distance problem states that for a compact set $A\subset \mathbb{R}^2$, if the Hausdorff dimension of $A$ is greater than $\frac{5}{4}$, then the distance set…

A binary code Enc$:\{0,1\}^k \to \{0,1\}^n$ is $(0.5-\epsilon,L)$-list decodable if for all $w \in \{0,1\}^n$, the set List$(w)$ of all messages $m \in \{0,1\}^k$ such that the relative Hamming distance between Enc$(m)$ and $w$ is at most…

In this paper, we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn…