中文
相关论文

相关论文: The width-volume inequality

200 篇论文

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

经典分析与常微分方程 · 数学 2020-07-20 Mario Santilli

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

组合数学 · 数学 2018-08-28 A. Abiad , G. Coutinho , M. A. Fiol

In this paper we give a relation between the volume of sublevel sets and the area of level sets using a Gelfand-Leray form. As a consequence, we give an estimation of the volume of sublevel sets. In particular we give a proof of the known…

经典分析与常微分方程 · 数学 2018-12-14 Trinh Duc Tai

The Johnson-Lindenstrauss (JL) Lemma introduced the concept of dimension reduction via a random linear map, which has become a fundamental technique in many computational settings. For a set of $n$ points in $\mathbb{R}^d$ and any fixed…

数据结构与算法 · 计算机科学 2026-02-23 Shaofeng H. -C. Jiang , Robert Krauthgamer , Shay Sapir

Many real-world machine learning problems involve inherently hierarchical data, yet traditional approaches rely on Euclidean metrics that fail to capture the discrete, branching nature of hierarchical relationships. We present a theoretical…

机器学习 · 计算机科学 2025-10-02 Gregory D. Baker , Scott McCallum , Dirk Pattinson

Given $n$ integer, let $X$ be either the set of hermitian or real $n\times n$ matrices of rank at least $n-1$. If $n$ is even, we give a sharp estimate on the maximal dimension of a real vector subspace of $X\cup\{0\}$. The rusults are…

代数拓扑 · 数学 2009-11-11 Andrea Causin

The $(k, z)$-Clustering problem in Euclidean space $\mathbb{R}^d$ has been extensively studied. Given the scale of data involved, compression methods for the Euclidean $(k, z)$-Clustering problem, such as data compression and dimension…

计算几何 · 计算机科学 2025-03-18 Xiaoyi Zhu , Yuxiang Tian , Lingxiao Huang , Zengfeng Huang

Consider the regular $n$-simplex $\Delta_n$ - it is formed by the convex-hull of $n+1$ points in Euclidean space, with each pair of points being in distance exactly one from each other. We prove an exact bound on the width of $\Delta_n$…

计算几何 · 计算机科学 2023-01-09 Sariel Har-Peled , Eliot W. Robson

We prove a discreteness result for the possible orders of harmonic maps from surfaces to Euclidean buildings; in particular for a building of type $W$ the order is of the form $\frac mk$ where $k$ divides $|W|$. This generalizes, in the…

微分几何 · 数学 2026-04-21 Christine Breiner , Ben K. Dees

The problem of estimating, from a random sample of points, the dimension of a compact subset $S$ of the Euclidean space is considered. The emphasis is put on consistency results in the statistical sense. That is, statements of convergence…

统计理论 · 数学 2025-07-08 Alejandro Cholaquidis , Antonio Cuevas , Beatriz Pateiro-López

In this paper, we firstly establish a new volume growth estimate for spacelike entire graphs in the pseudo-Euclidean space $\mathbb{R}^{m+n}_n$. Then by using this volume growth estimate and the Co-Area formula, we prove various rigidity…

微分几何 · 数学 2020-04-16 Hongbing Qiu , Linlin Sun

In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…

数学物理 · 物理学 2013-09-19 Petarpa Boonserm , Matt Visser

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

组合数学 · 数学 2015-01-30 Christine Bachoc , Alberto Passuello , Alain Thiery

The k-means problem consists of finding k centers in the d-dimensional Euclidean space that minimize the sum of the squared distances of all points in an input set P to their closest respective center. Awasthi et. al. recently showed that…

计算几何 · 计算机科学 2015-09-04 Euiwoong Lee , Melanie Schmidt , John Wright

The waist inequality states that for a continuous map from S^n to R^q, not all fibers can have small (n-q)-dimensional volume. We construct maps for which most fibers have small (n-q)-dimensional volume and all fibers have bounded…

微分几何 · 数学 2014-04-04 Hannah Alpert , Larry Guth

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

数值分析 · 数学 2020-07-27 Michael DiPasquale , Nelly Villamizar

A subset of Euclidean space will be said to be $n$-smooth if it has an $n$-dimensional tangent plane at each of its points. Let ${\frak d}_n$ denote the least number $n$-smooth sets into which $n+1$-dimensional Euclidean space can be…

逻辑 · 数学 2016-09-06 Juris Steprāns

We show that there exists a Banach space in which every non-empty weakly open subset of its unit ball has radius one, the maximum possible value, but the infimum of the diameter of its slices is exactly one, so extremely far from its…

泛函分析 · 数学 2025-10-20 Ginés López-Pérez , Esteban Martínez Vañó , Abraham Rueda Zoca

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

度量几何 · 数学 2025-12-10 Alexander E. Litvak , Mathias Sonnleitner , Tomasz Szczepanski

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

度量几何 · 数学 2013-12-23 David Alonso-Gutiérrez , Bernardo González , Carlos Hugo Jiménez