English
Related papers

Related papers: The Big-Line-Big-Clique Conjecture is False for In…

200 papers

We demonstrate an infinite family of pseudoline arrangements, in which an arrangement of n pseudolines has no member incident to more than 4n/9 points of intersection. This shows the "Strong Dirac" conjecture to be false for pseudolines. We…

Combinatorics · Mathematics 2014-01-14 Ben D. Lund , George B. Purdy , Justin W. Smith

This paper addresses one of the fundamental open questions in the realm of existential rules: the conjecture on the finite controllability of bounded derivation depth rule sets (bdd $\Rightarrow$ fc). We take a step toward a positive…

Databases · Computer Science 2026-03-11 Lucas Larroque , Piotr Ostropolski-Nalewaja , Michaël Thomazo

We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…

Number Theory · Mathematics 2008-10-30 M. Bruschi

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

A set S of 2n+1 points in the plane is said to be in general position if no three points of S are collinear and no four are concyclic. A circle is called halving with respect to S if it has three points of S on its circumference, n-1 points…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k, every multiset of n real numbers with nonnegative total sum has at least (n-1 choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a…

Combinatorics · Mathematics 2013-02-18 Stephen G. Hartke , Derrick Stolee

All sets of lines providing a partition of the set of internal points to a conic C in PG(2,q), q odd, are determined. There exist only three such linesets up to projectivities, namely the set of all nontangent lines to C through an external…

Combinatorics · Mathematics 2007-05-23 Massimo Giulietti

Let $K$ be a number field and $O_K$ the ring of integers of $K$. In the spirit of Siegel's theorem on integral points on affine algebraic curves, the plane Jacobian conjecture over $K$ is equivalent to the following statement: if $P,Q\in…

Algebraic Geometry · Mathematics 2017-09-26 Nguyen Van Chau

We show that for any large $n$, there exists a set of $n$ points in the plane with $O(n^2/\sqrt{\log n})$ distinct distances, such that any four points in the set determine at least five distinct distances. This answers (in the negative) a…

Combinatorics · Mathematics 2024-09-04 Terence Tao

We prove that if a finite point set in real space does not have too many points on a plane, then it spans a quadratic number of ordinary lines. This answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows that there is…

Combinatorics · Mathematics 2018-03-28 Frank de Zeeuw

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

A classical theorem of Siegel asserts that the set of S-integral points of an algebraic curve C over a number field is finite unless C has genus 0 and at most two points at infinity. In this paper we give necessary and sufficient conditions…

Number Theory · Mathematics 2009-07-14 Yuri Bilu , Alvanos Paraskevas , Poulakis Dimitrios

In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…

General Mathematics · Mathematics 2025-05-20 Jianqiang Zhao

The Sylvester-Gallai theorem says that for any finite set of non-collinear points in $\R^2$, there is some line passing through exactly two points of the set. Over the complex numbers, this theorem fails: there are finite configurations…

Combinatorics · Mathematics 2025-09-01 Alex Cohen

An empty pentagon in a point set P in the plane is a set of five points in P in strictly convex position with no other point of P in their convex hull. We prove that every finite set of at least 328k^2 points in the plane contains an empty…

A field $k$ is called large if every irreducible $k$-curve with a $k$-rational smooth point has infinitely many $k$-points. Let $k$ be a perfect large field and let $f \in k[x]$. Consider the evaluation map $f_k: k \to k$. Assume that $f_k$…

Number Theory · Mathematics 2014-04-17 Michiel Kosters

For each vector $x\in \ell^{\infty}$, we can define the non-empty compact set $L_x$ of accumulation points of $x$. Given an infinite subset $A$ of $\mathbb{N}\backslash\{1\}$, we can therefore investigate under which conditions on $A$, the…

Functional Analysis · Mathematics 2023-03-08 Quentin Menet , Dimitris Papathanasiou

Merker conjectured that if $k \ge 2$ is an integer and $G$ a 3-connected cubic planar graph of circumference at least $k$, then the set of cycle lengths of $G$ must contain at least one element of the interval $[k, 2k+2]$. We here prove…

Combinatorics · Mathematics 2020-09-02 Carol T. Zamfirescu

A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…

Combinatorics · Mathematics 2018-11-16 Nathan Lindzey

Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? We prove that at least $\lceil\log_2{n}\rceil-2$ plane perfect matchings can be…

Computational Geometry · Computer Science 2015-01-16 Ahmad Biniaz , Prosenjit Bose , Anil Maheshwari , Michiel Smid