English
Related papers

Related papers: Quantitative selection theorems

200 papers

The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…

Computational Geometry · Computer Science 2015-04-15 Aleksandar Nikolov

We prove that the multiplicity of a filtration of a local ring satisfies various convexity properties. In particular, we show the multiplicity is convex along geodesics. As a consequence, we prove that the volume of a valuation is log…

Algebraic Geometry · Mathematics 2024-03-22 Harold Blum , Yuchen Liu , Lu Qi

Given a hypothesis space, the large volume principle by Vladimir Vapnik prioritizes equivalence classes according to their volume in the hypothesis space. The volume approximation has hitherto been successfully applied to binary learning…

Machine Learning · Computer Science 2014-02-04 Gang Niu , Bo Dai , Marthinus Christoffel du Plessis , Masashi Sugiyama

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Functional Analysis · Mathematics 2010-06-02 Gordan Zitkovic

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M…

Optimization and Control · Mathematics 2024-11-01 Yushan Qu , Jon Lee

The colorful simplicial depth of a collection of d+1 finite sets of points in Euclidean d-space is the number of choices of a point from each set such that the origin is contained in their convex hull. We use methods from combinatorial…

Combinatorics · Mathematics 2016-07-04 Karim Adiprasito , Philip Brinkmann , Arnau Padrol , Pavel Paták , Zuzana Patáková , Raman Sanyal

We give a uniform approximation of the characteristic function of the boundary of a centrally symmetric n-dimensional compact and convex set by homogeneous polynomials of even degree $d$ fulfilling $|g_d-1|\leq E/d^{1/2-\beta}$, for every…

Functional Analysis · Mathematics 2021-07-27 Bernardo González Merino , Rafael Villa

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

Probability · Mathematics 2020-10-13 Imre Bárány , Matthieu Fradelizi , Xavier Goaoc , Alfredo Hubard , Günter Rote

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

Metric Geometry · Mathematics 2013-10-25 Matthias Henze

We prove an extension of the homology version of the Hofer-Zehnder conjecture proved by Shelukhin to the weighted projective spaces which are symplectic orbifolds. In particular, we prove that if the number of fixed points counted with…

Symplectic Geometry · Mathematics 2024-03-25 Simon Allais

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…

Probability · Mathematics 2019-08-08 Friedrich Götze , Anna Gusakova , Dmitry Zaporozhets

We study colorful no-dimensional Tverberg-type problems and obtain several optimal results. A colorful no-dimensional Tverberg-type theorem provides a bound on a radius $R$ such that, for any pairwise disjoint $k$-element subsets…

Metric Geometry · Mathematics 2025-09-29 Polina Barabanshchikova , Grigory Ivanov , Alexander Polyanskii

The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…

Metric Geometry · Mathematics 2012-04-24 Pablo Soberón

We study the question of how to compute a point in the convex hull of an input set $S$ of $n$ points in ${\mathbb R}^d$ in a differentially private manner. This question, which is trivial non-privately, turns out to be quite deep when…

Data Structures and Algorithms · Computer Science 2020-03-31 Haim Kaplan , Micha Sharir , Uri Stemmer

We study the expected volume of random polytopes generated by taking the convex hull of independent identically distributed points from a given distribution. We show that for log-concave distributions supported on convex bodies, we need at…

Metric Geometry · Mathematics 2021-11-16 Debsoumya Chakraborti , Tomasz Tkocz , Beatrice-Helen Vritsiou

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

Metric Geometry · Mathematics 2007-05-23 Mark W. Meckes

We provide theorems containnig both Kakutani and Browder fixed points theorems as immediate corollaries, as well as Michael and Browder selection theorems. For this purpose we introduce convex structures more general than those of locally…

Functional Analysis · Mathematics 2007-05-23 Peter Saveliev

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…

Classical Analysis and ODEs · Mathematics 2025-03-31 Pablo Shmerkin , Alexia Yavicoli

Sampling biases in training data are a major source of algorithmic biases in machine learning systems. Although there are many methods that attempt to mitigate such algorithmic biases during training, the most direct and obvious way is…

Machine Learning · Statistics 2022-04-15 Laura Niss , Yuekai Sun , Ambuj Tewari
‹ Prev 1 4 5 6 7 8 10 Next ›