English
Related papers

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

200 papers

The infinite reduction of couplings is a tool to consistently renormalize a wide class of non-renormalizable theories with a reduced, eventually finite, set of independent couplings, and classify the non-renormalizable interactions. Several…

High Energy Physics - Theory · Physics 2009-11-11 Damiano Anselmi , Milenko Halat

We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…

Data Structures and Algorithms · Computer Science 2023-12-08 Sunny Atalig , Marek Chrobak

Let $\mathsf{S}_1$ (the Schatten--von Neumann trace class) denote the Banach space of all compact linear operators $T:\ell_2\to \ell_2$ whose nuclear norm $\|T\|_{\mathsf{S}_1}=\sum_{j=1}^\infty\sigma_j(T)$ is finite, where…

Functional Analysis · Mathematics 2017-10-25 Assaf Naor , Gilles Pisier , Gideon Schechtman

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$…

Combinatorics · Mathematics 2013-11-28 David Ellis

An $(r,M,2\delta;k)_q$ constant--dimension subspace code, $\delta >1$, is a collection $\cal C$ of $(k-1)$--dimensional projective subspaces of ${\rm PG(r-1,q)}$ such that every $(k-\delta)$--dimensional projective subspace of ${\rm…

Combinatorics · Mathematics 2014-11-14 Antonio Cossidente , Francesco Pavese

We study the effect of Johnson-Lindenstrauss transforms in various projective clustering problems, generalizing recent results which only applied to center-based clustering [MMR19]. We ask the general question: for a Euclidean optimization…

Data Structures and Algorithms · Computer Science 2023-07-11 Moses Charikar , Erik Waingarten

The tree-metric theorem provides a necessary and sufficient condition for a dissimilarity matrix to be a tree metric, and has served as the foundation for numerous distance-based reconstruction methods in phylogenetics. Our main result is…

Combinatorics · Mathematics 2007-05-23 Lior Pachter , David E Speyer

There are two positive, absolute constants $c_{1}$ and $c_{2}$ so that the volume of the difference set of the $d$-dimensional Euclidean ball and an inscribed polytope with n vertices is larger than $$ c_{2}\ d\…

Metric Geometry · Mathematics 2008-02-03 Yehoram Gordon , Shlomo Reisner , Carsten Schütt

We consider the eccentric graph of a graph $G$, denoted by $ecc(G)$, which has the same vertex set as $G$, and two vertices in the eccentric graph are adjacent iff their distance in $G$ is equal to the eccentricity of one of them. In this…

Combinatorics · Mathematics 2024-07-30 Sezer Sorgun , Esma Elyemani

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…

Metric Geometry · Mathematics 2017-04-04 Noga Alon , Bo'az Klartag

For a tree $T$ and a function $f \colon E(T)\to \mathbb{S}^d$, the imbalance of a subtree $T'\subseteq T$ is given by $|\sum_{e \in E(T')} f(e)|$. The $d$-dimensional discrepancy of the tree $T$ is the minimum, over all functions $f$ as…

Combinatorics · Mathematics 2024-12-06 Lawrence Hollom , Lyuben Lichev , Adva Mond , Julien Portier

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…

Computational Complexity · Computer Science 2007-05-23 Jack H. Lutz

It is known that there is a constant $c > 0$ such that for every sequence $x_1, x_2, \ldots$ in $[0,1)$ we have for the star discrepancy $D_N^*$ of the first $N$ elements of the sequence that $N D_N^* \ge c \cdot \log N$ holds for…

Number Theory · Mathematics 2014-07-09 Gerhard Larcher

The large scale structure bispectrum in the squeezed limit couples large with small scales. Since relativity is important at large scales and non-linear loop corrections are important at small scales, the proper calculation of the observed…

Cosmology and Nongalactic Astrophysics · Physics 2019-07-24 Lina Castiblanco , Radouane Gannouji , Jorge Noreña , Clément Stahl

Let $\chi$ be a Dirichlet character modulo a prime~$p$. We give explicit upper bounds on $q_1<q_2<\dots<q_n$, the $n$ smallest prime nonresidues of $\chi$. More precisely, given $n_0$ and $p_0$ there exists an absolute constant…

Number Theory · Mathematics 2019-08-12 Shilin Ma , Kevin J. McGown , Devon Rhodes , Mathias Wanner

We prove that for any $E\subset{\Bbb R}^2$, $\dim_{\mathcal{H}}(E)>1$, there exists $x\in E$ such that the Hausdorff dimension of the pinned distance set $$\Delta_x(E)=\{|x-y|: y \in E\}$$ is no less than…

Classical Analysis and ODEs · Mathematics 2019-11-06 Bochen Liu

Let $u$ be a solution to an elliptic equation $\text{div}(A\nabla u)=0$ with Lipschitz coefficients in $\mathbb{R}^n$. Assume $|u|$ is bounded by $1$ in the ball $B=\{|x|\leq 1\}$. We show that if $|u| < \varepsilon$ on a set $ E \subset…

Analysis of PDEs · Mathematics 2017-11-29 Alexander Logunov , Eugenia Malinnikova

The main result of the paper: Given any $\varepsilon>0$, every locally finite subset of $\ell_2$ admits a $(1+\varepsilon)$-bilipschitz embedding into an arbitrary infinite-dimensional Banach space. The result is based on two results which…

Functional Analysis · Mathematics 2023-09-14 Florin Catrina , Sofiya Ostrovska , Mikhail I. Ostrovskii

In this paper we discuss and prove $\epsilon$-regularity theorems for Einstein manifolds $(M^n,g)$, and more generally manifolds with just bounded Ricci curvature, in the collapsed setting. A key tool in the regularity theory of…

Differential Geometry · Mathematics 2016-10-19 Aaron Naber , Ruobing Zhang

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin