English
Related papers

Related papers: Quantitative combinatorial geometry for concave fu…

200 papers

In this paper, we prove the holomorphic convexity of the covering of a complex projective {normal} variety $X$, which corresponds to the intersection of kernels of reductive representations $\rho:\pi_1(X)\to {\rm GL}_{N}(\mathbb{C})$,…

Algebraic Geometry · Mathematics 2024-05-30 Ya Deng , Katsutoshi Yamanoi , Ludmil Katzarkov

In this paper, we present a variety of problems in the interface between combinatorics and geometry around the theorems of Helly, Radon, Carath\'eodory, and Tverberg. Through these problems we describe the fascinating area of Helly-type…

Combinatorics · Mathematics 2021-10-28 Imre Bárány , Gil Kalai

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Combinatorics · Mathematics 2023-07-25 Jozsef Solymosi

We generalize [Vav] to give sufficient conditions, primarily on coarse geometry, to ensure that a subset of a Cayley graph is a finite Hausdorff distance from a subgroup. Using this result, we prove a partial converse to the Flat Torus…

Group Theory · Mathematics 2010-06-11 Diane M. Vavrichek

The aim of this note is to give an elementary proof of the following fact: given 3 red convex sets and 3 blue convex sets in $\mathbb{E}^3$, such that every red intersects every blue, there is a line transversal to the reds or there is a…

Combinatorics · Mathematics 2021-12-10 Ricardo Strausz

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…

Data Structures and Algorithms · Computer Science 2016-12-13 Israela Solomon

This paper addresses the fundamental question of when convex sets remain disjoint after random projection. We provide an analysis using ideas from high-dimensional convex geometry. For ellipsoids, we provide a bound in terms of the distance…

Machine Learning · Computer Science 2014-04-14 Afonso S. Bandeira , Dustin G. Mixon , Benjamin Recht

A collection of sets is intersecting, if any pair of sets in the collection has nonempty intersection. A collection of sets \(\mathcal{C}\) has the Helly property if any intersecting subcollection has nonempty intersection. A graph is…

Combinatorics · Mathematics 2022-05-26 Rafael Villarroel-Flores

We prove the following colorful Helly-type result: Fix $k \in [d-1]$. Assume $\mathcal{A}_1, \dots, \mathcal{A}_{d+(d-k)+1}$ are finite sets (colors) of nonzero vectors in $\R^d$. If for every rainbow sub-selection $R$ from these sets of…

Combinatorics · Mathematics 2025-12-02 Grigory Ivanov

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

Combinatorics · Mathematics 2023-01-19 Csaba Biró , Jenő Lehel , Géza Tóth

We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…

Functional Analysis · Mathematics 2018-10-22 S. N. Melikhov , L. V. Khanina

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

Algebraic Geometry · Mathematics 2026-01-21 Alejandro González Nevado

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

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Optimization and Control · Mathematics 2023-05-04 Daniel Dörfler

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In…

Discrete Mathematics · Computer Science 2016-04-13 Thomas Rothvoss

In this paper, we study bijections on strictly convex sets of $\mathbf R \mathbf P^n$ for $n \geq 2$ and closed convex projective surfaces equipped with the Hilbert metric that map complete geodesics to complete geodesics as sets.…

Metric Geometry · Mathematics 2022-09-13 Drimik Roy Chowdhury

In this paper we give a new and simplified proof of the variational Hodge conjecture for complete intersection cycles on a hypersurface in projective space.

Algebraic Geometry · Mathematics 2023-10-10 Remke Kloosterman

We prove the following variant of Helly's classical theorem for Hamming balls with a bounded radius. For $n>t$ and any (finite or infinite) set $X$, if in a family of Hamming balls of radius $t$ in $X^n$, every subfamily of at most…

Combinatorics · Mathematics 2024-06-04 Noga Alon , Zhihan Jin , Benny Sudakov