English
Related papers

Related papers: Maximum Solow--Polasky Diversity Subset Selection …

200 papers

Let $|\cdot|$ be the standard Euclidean norm on $\mathbb{R}^n$ and let $X=(\mathbb{R}^n,\|\cdot\|)$ be a normed space. A subspace $Y\subset X$ is \emph{strongly $\alpha$-Euclidean} if there is a constant $t$ such that…

Functional Analysis · Mathematics 2021-10-08 W. T. Gowers , K. Wyczesany

We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…

Metric Geometry · Mathematics 2007-05-23 Sanjeev Arora , James R. Lee , Assaf Naor

General extensions of an inequality due to Rogozin, concerning the essential supremum of a convolution of probability density functions on the real line, are obtained. While a weak version of the inequality is proved in the very general…

Probability · Mathematics 2017-05-03 Mokshay Madiman , James Melbourne , Peng Xu

We study a property of $2$-strong uniqueness of a best approximation in a class of finite-dimensional complex normed spaces, for which the unit ball is an absolutely convex hull of finite number of points and in its dual class. We prove…

Functional Analysis · Mathematics 2025-06-02 Tomasz Kobos , Grzegorz Lewicki

The paper is devoted to provide Michael-Simon-type $L^p$-logarithmic-Sobolev inequalities on complete, not necessarily compact $n$-dimensional submanifolds $\Sigma$ of the Euclidean space $\mathbb R^{n+m}$. Our first result, stated for…

Differential Geometry · Mathematics 2026-01-22 Zoltán M. Balogh , Alexandru Kristály

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Functional Analysis · Mathematics 2020-11-11 Michael Dymond , Olga Maleva

We consider the problem of finding an $N$-point configuration on the sphere $S^d\subset \RR^{d+1}$ with the smallest absolute maximum value over $S^d$ of its total potential. The potential induced by each point ${\bf y}$ in a given…

Classical Analysis and ODEs · Mathematics 2022-03-28 Sergiy Borodachov

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…

Computational Geometry · Computer Science 2013-03-13 Rainer Penninger , Ivo Vigan

Motivated by the problem of compressing point sets into as few bits as possible while maintaining information about approximate distances between points, we construct random nonlinear maps $\varphi_\ell$ that compress point sets in the…

Computational Geometry · Computer Science 2024-03-05 Brett Leroux , Luis Rademacher

Best subset selection (BSS) is widely known as the holy grail for high-dimensional variable selection. Nevertheless, the notorious NP-hardness of BSS substantially restricts its practical application and also discourages its theoretical…

Methodology · Statistics 2021-08-27 Yongyi Guo , Ziwei Zhu , Jianqing Fan

We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

Consider $n$ points $x_1,\ldots,x_n$ in finite-dimensional euclidean space, each having one of two colors. Suppose there exists a separating hyperplane (identified with its unit normal vector $w)$ for the points, i.e a hyperplane such that…

Machine Learning · Statistics 2020-11-24 Elvis Dohmatob

We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways. 1. We prove a point-to-set…

Computational Complexity · Computer Science 2016-12-02 Jack H. Lutz , Neil Lutz

We develop a general toolbox to study $W^{1,p}$ solutions of differential inclusions $\nabla u \in K$ for unbounded sets $K$. A key notion is the concept that a subset $K$ of the space $\mathbb{R}^{d \times m}$ of $d \times m$ matrices can…

Analysis of PDEs · Mathematics 2024-04-01 Bruce Kleiner , Stefan Müller , László Székelyhidi , Xiangdong Xie

We present a proof architecture for \(P \neq NP\) based on an upper--lower clash in polytime-capped conditional description length. We construct an efficiently samplable family of SAT instances \(Y\) such that every satisfying witness for…

Computational Complexity · Computer Science 2026-04-24 Ben Goertzel

Recent years have seen great progress in the approximability of fundamental clustering and facility location problems on high-dimensional Euclidean spaces, including $k$-Means and $k$-Median. While they admit strictly better approximation…

Data Structures and Algorithms · Computer Science 2025-01-31 Euiwoong Lee , Kijun Shin

We introduce a unified geometric framework for domains satisfying a geometric normal property (C-GNP) relative to a strictly convex set \(C\). Under the fundamental assumption that the source \(f\) is supported within the core \(C\), we…

Analysis of PDEs · Mathematics 2026-04-22 Mohammed Barkatou

This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials…

Metric Geometry · Mathematics 2025-10-30 Olga Anosova , Daniel Widdowson , Vitaliy Kurlin

Diversities are like metric spaces, except that every finite subset, instead of just every pair of points, is assigned a value. Just as there is a theory of minimal distortion embeddings of finite metric spaces into $L_1$, there is a…

Metric Geometry · Mathematics 2016-11-10 David Bryant , Paul F. Tupper

A finite set $X \seq \RR^n$ with a weight function $w : X \longrightarrow \RR_{>0}$ is called \emph{Euclidean $t$-design} in $\RR^n$ (supported by $p$ concentric spheres) if the following condition holds: \[ \sum_{i=1}^p…

Combinatorics · Mathematics 2010-12-10 Djoko Suprijanto