English
Related papers

Related papers: A Result About the Density of Iterated Line Inters…

200 papers

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

Combinatorics · Mathematics 2015-07-08 János Pach , Natan Rubin , Gábor Tardos

We show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an…

Computational Geometry · Computer Science 2025-02-25 Oswin Aichholzer , Sergio Cabello , Viola Mészáros , Patrick Schnider , Jan Soukup

A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…

Combinatorics · Mathematics 2022-10-24 Charles J. Colbourn , Colin Ingalls , Jonathan Jedwab , Mark Saaltink , Ken W. Smith , Brett Stevens

We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of…

Dynamical Systems · Mathematics 2009-02-03 Nikolai A. Krylov , Edwin L. Rogers

Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…

Combinatorics · Mathematics 2019-08-20 Chaya Keller , Rom Pinchasi

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

Computational Geometry · Computer Science 2017-06-08 Sariel Har-Peled , Mitchell Jones

A set of points $S \subseteq \mathbb{F}_p^n$ is called \emph{$p$-divisible} if every affine hyperplane in $\mathbb{F}_p^n$ intersects $S$ in $0 \pmod p$ points. The Strong Cylinder Conjecture of Ball asserts that if $S$ is a $p$-divisible…

Combinatorics · Mathematics 2026-01-16 Gergely Kiss , Ádám Markó , Zoltán Lóránt Nagy , Gábor Somlai

We generalize the joints problem to sets of varieties and prove almost sharp bound on the number of joints. As a special case, given a set of $N$ $2$-planes in $\mathbb{R}^6$, the number of points at which three $2$-planes intersect and…

Combinatorics · Mathematics 2016-06-29 Ben Yang

Working over a field ${\mathbb{k}}$ of characteristic $\ne 2$, we study what we call bisector fields, which are arrangements of paired lines in the plane that have the property that each line in the arrangement crosses the paired lines in…

Algebraic Geometry · Mathematics 2023-06-16 Bruce Olberding , Elaine A. Walker

We consider the range of random analytic functions with finite radius of convergence. We show that any unbounded random Taylor series with rotationally invariant coefficients has dense image in the plane. We moreover show that if in…

Probability · Mathematics 2024-05-27 Alon Nishry , Elliot Paquette

Conditions are given which imply that analytic iterated function systems (IFS's) in the complex plane have uniformly perfect attractor sets. In particular, it is shown that the attractor set of a finitely generated conformal IFS is…

Dynamical Systems · Mathematics 2007-08-24 Rich Stankewitz

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 simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Combinatorics · Mathematics 2015-01-30 Jan Kynčl , János Pach , Radoš Radoičić , Géza Tóth

We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean…

Combinatorics · Mathematics 2010-06-23 Alice Paul , Nicholas Pippenger

The average value of the number of intersection points of two plane curves given by trigonometrical polynomial maps of degree $N$ and bounded $L_2$- or $W_2^r$- norms is calculated

Classical Analysis and ODEs · Mathematics 2023-03-23 V. A. Vassiliev

The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…

Combinatorics · Mathematics 2018-02-23 Frank de Zeeuw

We consider the isoperimetric problem for the sum of two Gaussian densities in the line and the plane. We prove that the double Gaussian isoperimetric regions in the line are rays and that if the double Gaussian isoperimetric regions in the…

General Mathematics · Mathematics 2018-04-04 John Berry , Matthew Dannenberg , Jason Liang , Yingyi Zeng

Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…

Algebraic Geometry · Mathematics 2023-06-01 Cameron Darwin , Aygul Galimova , Miao Pam Gu , Stephen McKean

Given a stationary and isotropic Poisson hyperplane process and a convex body $K$ in ${\mathbb R}^d$, we consider the random polytope defined by the intersection of all closed halfspaces containing $K$ that are bounded by hyperplanes of the…

Probability · Mathematics 2020-02-19 Rolf Schneider
‹ Prev 1 4 5 6 7 8 10 Next ›