English
Related papers

Related papers: Discrete Helly-type theorems for pseudohalfplanes

200 papers

Alon and F\"uredi (European J. Combin., 1993) proved that any family of hyperplanes that covers every point of the Boolean cube $\{0,1\}^n$ except one must contain at least $n$ hyperplanes. We obtain two extensions of this result, in…

Combinatorics · Mathematics 2023-01-03 S. Venkitesh

We prove that for every $m$ there is a finite point set $\mathcal{P}$ in the plane such that no matter how $\mathcal{P}$ is three-colored, there is always a disk containing exactly $m$ points, all of the same color. This improves a result…

Combinatorics · Mathematics 2020-11-25 Gábor Damásdi , Pálvölgyi Dömötör

Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of…

Computational Geometry · Computer Science 2024-09-06 Oswin Aichholzer , Julia Obmann , Pavel Paták , Daniel Perz , Josef Tkadlec , Birgit Vogtenhuber

Let $H$ be a set of $n$ halfplanes in $\mathbb{R}^2$ in general position, and let $k<n$ be a given parameter. We show that the number of vertices of the arrangement of $H$ that lie at depth exactly $k$ (i.e., that are contained in the…

Computational Geometry · Computer Science 2016-09-29 Sariel Har-Peled , Micha Sharir

We prove that for a topological space X with the property that $H_p(U)=0$ for $p\geq d$ and every open subset $U$ of $X$, a finite family of open sets in $X$ has nonempty intersection if for any subfamily of size $j$, $1\leq j \leq d+1$,…

Metric Geometry · Mathematics 2014-07-09 Luis Montejano

Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…

Computational Geometry · Computer Science 2024-10-15 Oswin Aichholzer , Joachim Orthaber , Birgit Vogtenhuber

Given a map from a rectangle in the n-dimensional real Euclidean space into a metric semigroup, we introduce a concept of the total variation, which generalizes a similar concept due to T. H. Hildebrandt (1963) for real functions of two…

Functional Analysis · Mathematics 2010-08-20 Vyacheslav V. Chistyakov , Yuliya V. Tretyachenko

Two celebrated extensions of Helly's theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of B\'ar\'any, Katchalski, and Pach (1982). Improving on several recent works, we prove an…

Combinatorics · Mathematics 2024-05-22 Nóra Frankl , Attila Jung , István Tomon

Let $P \subset \mathbb{R}^{d}$ be a closed convex cone. Assume that $P$ is pointed, i.e. the intersection $P \cap -P=\{0\}$ and $P$ is spanning, i.e. $P-P=\mathbb{R}^{d}$. Denote the interior of $P$ by $\Omega$. Let $E$ be a product system…

Operator Algebras · Mathematics 2020-08-04 S. P. Murugan , S. Sundar

A subset $M$ of the edges of a graph or hypergraph is hitting if $M$ covers each vertex of $H$ at least once, and $M$ is $t$-shallow if it covers each vertex of $H$ at most $t$ times. We consider the existence of shallow hitting edge sets…

Combinatorics · Mathematics 2023-07-13 Tim Planken , Torsten Ueckerdt

In this paper we study the linear series |L-3p| of hyperplane sections with a triple point p of a surface S embedded via a very ample line bundle L for a general point p. If this linear series does not have the expected dimension we call…

Algebraic Geometry · Mathematics 2009-11-06 Luca Chiantini , Thomas Markwig

The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets. We introduce an abstract version of a framework by Smorodinsky and Yuditsky, used for…

Combinatorics · Mathematics 2019-02-25 Balázs Keszegh , Dömötör Pálvölgyi

For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-packing. An informal statement of a special case of our…

Combinatorics · Mathematics 2019-02-20 John Lenz , Dhruv Mubayi

A result due to Gy\'arf\'as, Hubenko, and Solymosi (answering a question of Erd\"os) states that if a graph $G$ on $n$ vertices does not contain $K_{2,2}$ as an induced subgraph yet has at least $c\binom{n}{2}$ edges, then $G$ has a…

Combinatorics · Mathematics 2019-04-11 Andreas F. Holmsen

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…

Combinatorics · Mathematics 2015-09-07 János Pach , Konrad J. Swanepoel

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

Combinatorics · Mathematics 2010-01-26 Thomas Zaslavsky

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…

Metric Geometry · Mathematics 2018-07-05 J. Jerónimo-Castro , E. Makai,

A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}^d$ if the intersection of every subset of $k$ convex sets in $\mathcal F$ contains a point in $S$. The Helly number of $S$ is the minimum $k$, if it…

Combinatorics · Mathematics 2025-04-24 Srinivas Arun , Travis Dillon

Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…

Metric Geometry · Mathematics 2020-09-02 Zakhar Kabluchko
‹ Prev 1 3 4 5 6 7 10 Next ›