English
Related papers

Related papers: A new discrete theory of pseudoconvexity

200 papers

We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…

Geometric Topology · Mathematics 2015-11-25 Matthew Gentry Durham , Samuel J. Taylor

A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We…

Metric Geometry · Mathematics 2020-09-08 Travis Dillon , Pablo Soberón

We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…

Operator Algebras · Mathematics 2017-05-15 Pere Ara , Matias Lolk

A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…

Logic · Mathematics 2024-06-12 Niels Charlier , Hans Vernaeve

We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…

Combinatorics · Mathematics 2020-05-05 Sherry Sarkar , Alexander Xue , Pablo Soberón

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

Combinatorics · Mathematics 2016-08-24 Gábor Czédli , János Kincses

Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…

Combinatorics · Mathematics 2019-07-04 Minki Kim

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

Representation Theory · Mathematics 2024-02-22 Valdemar V. Tsanov

We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…

Logic · Mathematics 2026-03-26 Connor Martinez Lockhart

We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…

Combinatorics · Mathematics 2016-12-13 Leonardo Martínez-Sandoval , Roee Tamam

To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…

Combinatorics · Mathematics 2015-06-23 Priyavrat Deshpande

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…

Combinatorics · Mathematics 2014-12-01 David Saxton , Andrew Thomason

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

Several papers have been written studying unexpected hypersurfaces. We say a finite set of points Z admits unexpected hypersurfaces if a general union of fat linear subspaces imposes less that the expected number of conditions on the ideal…

Algebraic Geometry · Mathematics 2020-03-06 Bill Trok

One widely applied sufficient condition for the existence of a colorful simplex in a vertex-colored simplicial complex is a topological extension of Hall's transversal theorem due to Aharoni, Haxell, and Meshulam. We prove a similar…

Combinatorics · Mathematics 2025-11-10 Ronen Wdowinski

We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…

Algebraic Topology · Mathematics 2025-12-23 Daniel Carranza , Chris Kapulkin

We study parameters of the convexity spaces associated with families of sets in $\mathbb{R}^d$ where every intersection between $t$ sets of the family has its Betti numbers bounded from above by a function of $t$. Although the Radon number…

Computational Geometry · Computer Science 2024-11-28 Marguerite Bin

Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…

High Energy Physics - Theory · Physics 2009-10-28 A. Dimakis , F. Müller-Hoissen

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Combinatorics · Mathematics 2016-03-29 Rade T. Živaljević

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…

Optimization and Control · Mathematics 2008-12-04 Jean B. Lasserre