English
Related papers

Related papers: A Pseudoline Counterexample to the Strong Dirac Co…

200 papers

Dirac and Motzkin conjectured that any set X of $n$ non-collinear points in the plane has an element incident with at least $\lceil \frac{n}{2} \rceil$ lines spanned by X. In this paper we prove that any set X of $n$ non-collinear points in…

Combinatorics · Mathematics 2025-01-31 Jan Florek

In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of $n$…

Combinatorics · Mathematics 2022-08-30 Adrian Dumitrescu

We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree…

Combinatorics · Mathematics 2008-09-12 Cornelia Dangelmayr , Stefan Felsner , William T. Trotter

We study point-line incidence structures and their properties in the projective plane. Our motivation is the problem of the existence of $(n_4)$ configurations, still open for few remaining values of $n$. Our approach is based on…

Computational Geometry · Computer Science 2023-11-14 Jürgen Bokowski , Vincent Pilaud

The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…

Geometric Topology · Mathematics 2013-04-30 Michael Friedman , David Garber

We show that for large enough $n$, the number of non-isomorphic pseudoline arrangements of order $n$ is greater than $2^{c\cdot n^2}$ for some constant $c > 0.2604$, improving the previous best bound of $c>0.2083$ by Dumitrescu and Mandal…

Computational Geometry · Computer Science 2024-02-22 Justin Dallant

The circular external difference family and its strong version, which themselves are of independent combinatorial interest, were proposed as variants of the difference family to construct new unconditionally secure non-malleable threshold…

Combinatorics · Mathematics 2023-10-31 Huawei Wu , Jing Yang , Keqin Feng

We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…

Combinatorics · Mathematics 2015-01-13 Micha Sharir , Noam Solomon

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…

Combinatorics · Mathematics 2016-07-14 Orit E. Raz , Oliver Roche-Newton , Micha Sharir

We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…

Algebraic Geometry · Mathematics 2025-10-01 Marek Janasz , Izabela Leśniak

We consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…

Combinatorics · Mathematics 2023-12-27 Chao Cheng

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

Let $P = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p$, $p$ a prime. Assume that $P= A\times A$ has $n$ elements, $n<p$. See $P$ as a set of points in the plane over $\mathbb{F}_p$. We show that the pairs of points in $P$ determine…

Combinatorics · Mathematics 2014-01-14 Harald Andres Helfgott , Misha Rudnev

An arrangement of pseudocircles $\mathcal{A}$ is a collection of Jordan curves in the plane that pairwise intersect (transversally) at exactly two points. How many non-equivalent links have $\mathcal{A}$ as their shadow? Motivated by this…

Geometric Topology · Mathematics 2023-12-22 Carolina Medina , Santino Ramirez , Jorge L. Ramirez-Alfonsin , Gelasio Salazar

The big-line-big-clique conjecture states that for all $k,\ell\geq2$ there is an integer $n$ such that every finite set of at least $n$ points in the plane contains $\ell$ collinear points or $k$ pairwise visible points. We show that this…

Combinatorics · Mathematics 2010-08-19 Attila~Pór , David R. Wood

We prove the existence of infinitely many non square-integrable stationary solutions for a family of massless Dirac equations in 2D. They appear as effective equations in two dimensional honeycomb structures. We give a direct existence…

Analysis of PDEs · Mathematics 2018-07-31 William Borrelli

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

Combinatorics · Mathematics 2007-05-23 Jeremy J. Carroll

A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…

Combinatorics · Mathematics 2021-07-01 Misha Rudnev

We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically $12^n…

Combinatorics · Mathematics 2009-07-07 Oswin Aichholzer , David Orden , Francisco Santos , Bettina Speckmann

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…

Combinatorics · Mathematics 2007-05-23 Ronald Ortner