English
Related papers

Related papers: Intersections of vertical lines with non-vertical …

200 papers

For a pair of points in a smooth locally convex surface in 3-space, its mid-plane is the plane containing its mid-point and the intersection line of the corresponding pair of tangent planes. In this paper we show that the limit of…

Differential Geometry · Mathematics 2017-05-08 Ady Cambraia Junior , Marcos Craizer

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

Metric Geometry · Mathematics 2017-06-22 Simeon Ball

For a set of points in the plane, a \emph{crossing family} is a set of line segments, each joining two of the points, such that any two line segments cross. We investigate the following generalization of crossing families: a \emph{spoke…

Computational Geometry · Computer Science 2017-02-27 Patrick Schnider

Denote the collection of all $k$-flats in $AG(n,\mathbb{F}_q)$ by $\mathscr{M}(k,n)$. Let $\mathscr{F}_1\subset\mathscr{M}(k_1,n)$ and $\mathscr{F}_2\subset\mathscr{M}(k_2,n)$ satisfy $\dim(F_1\cap F_2)\ge t$ for any $F_1\in\mathscr{F}_1$…

Combinatorics · Mathematics 2022-02-16 Tian Yao , Kaishun Wang

Let $\mathcal{K}$ denote a nonsingular conic in the complex projective plane. Pascal's theorem says that, given six distinct points $A,B,C,D,E,F$ on $\mathcal{K}$, the three intersection points $AE \cap BF, AD \cap CF, BD \cap CE$ are…

Algebraic Geometry · Mathematics 2022-07-26 Jaydeep Chipalkatti , Sergio Da Silva

A family of permutations $\mathcal{F} \subseteq S_n$ is even-cycle-intersecting if $\sigma \pi^{-1}$ has an even cycle for all $\sigma,\pi \in \mathcal{F}$. We show that if $\mathcal{F} \subseteq S_n$ is an even-cycle-intersecting family of…

Combinatorics · Mathematics 2026-01-21 Nathan Lindzey

We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges. Graphs that admit such…

Combinatorics · Mathematics 2016-08-31 Eyal Ackerman , Balázs Keszegh , Mate Vizer

Let $P$ be a set of $2n$ points in the plane, and let $M_{\rm C}$ (resp., $M_{\rm NC}$) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of $P$. We study the problem of computing $M_{\rm NC}$. We first prove that the…

Computational Geometry · Computer Science 2012-02-21 A. Karim Abu-Affash , Paz Carmi , Matthew J. Katz , Yohai Trabelsi

Given two points in the plane, a set of obstacles defined by closed curves, and an integer $k$, does there exist a path between the two designated points intersecting at most $k$ of the obstacles? This is a fundamental and well-studied…

Data Structures and Algorithms · Computer Science 2020-02-05 Eduard Eiben , Daniel Lokshtanov

A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…

Computational Geometry · Computer Science 2022-10-03 Oswin Aichholzer , Jan Kynčl , Manfred Scheucher , Birgit Vogtenhuber , Pavel Valtr

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

Combinatorics · Mathematics 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

Combinatorics · Mathematics 2018-10-15 Jozsef Balogh , Jozsef Solymosi

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…

Metric Geometry · Mathematics 2014-02-25 Xiaomin Chen , Guangda Huzhang , Peihan Miao , Kuan Yang

A family $\mathcal{F}\subset \binom{[n]}{k}$ is called an intersecting family if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. If $\cap \mathcal{F}\neq \emptyset$ then $\mathcal{F}$ is called a star. The diversity of an…

Combinatorics · Mathematics 2023-04-24 Peter Frankl , Jian Wang

A nonlinear flag is a finite sequence of nested closed submanifolds. We study the geometry of Frechet manifolds of nonlinear flags, in this way generalizing the nonlinear Grassmannians. As an application we describe a class of coadjoint…

Differential Geometry · Mathematics 2021-09-06 Stefan Haller , Cornelia Vizman

We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a…

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

A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all sets from $\mathcal F$ is equal to $\tau$. Let $M(n,k,\tau)$ stand for the size of the largest intersecting family $\mathcal F$ of $k$-element…

Combinatorics · Mathematics 2023-05-09 Peter Frankl , Andrey Kupavskii

Let X be a complete intersection of two hypersurfaces F_n and F_k in the projective space P^5 of degree n and k respectively with n >= k, such that the singularities of X are nodal and F_k is smooth. We prove that if the threefold X has at…

Algebraic Geometry · Mathematics 2008-09-01 Dimitra Kosta

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao