English
Related papers

Related papers: On infinite sets with no $3$ on a line

200 papers

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

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

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Combinatorics · Mathematics 2023-07-25 Jozsef Solymosi

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

Classical Analysis and ODEs · Mathematics 2019-01-08 Ben Krause

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…

Combinatorics · Mathematics 2024-11-07 Dániel T. Nagy , Zoltán Lóránt Nagy , Russ Woodroofe

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

Combinatorics · Mathematics 2016-01-28 Luka Milićević

Which finite sets $P \subseteq \mathbb{Z}^r$ with $|P| \ge 3$ have the following property: for every $A \subseteq [N]^r$, there is some nonzero integer $d$ such that $A$ contains $(\alpha^{|P|} - o(1))N^r$ translates of $d \cdot P = \{d p :…

Combinatorics · Mathematics 2021-08-02 Ashwin Sah , Mehtaab Sawhney , Yufei Zhao

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

Dynamical Systems · Mathematics 2024-04-22 Ioannis Kousek , Tristán Radić

We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…

Combinatorics · Mathematics 2021-07-06 Emma Cohen , Will Perkins , Michail Sarantis , Prasad Tetali

We investigate dense lineability and spaceability of subsets of $\ell_\infty$ with a prescribed number of accumulation points. We prove that the set of all bounded sequences with exactly countably many accumulation points is densely…

Functional Analysis · Mathematics 2023-05-18 Paolo Leonetti , Tommaso Russo , Jacopo Somaglia

A set of points $S$ in Euclidean space $\mathbb{R}^d$ is called \textit{Ramsey} if any finite partition of $\mathbb{R}^{\infty}$ yields a monochromatic copy of $S$. While characterization of Ramsey set remains a major open problem in the…

Combinatorics · Mathematics 2025-08-11 Vojtěch Rödl , Marcelo Sales

Let $D$ be a non-empty effective divisor on $\mathbb{P}^1$. We show that when ordered by height, any set of $(D,S)$-integral points on $\mathbb{P}^1$ of bounded degree has relative density zero. We then apply this to arithmetic dynamics:…

Number Theory · Mathematics 2016-07-29 Joseph Gunther , Wade Hindes

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

Metric Geometry · Mathematics 2026-04-13 David Eppstein

We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon. As an application, we settle the next…

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…

Combinatorics · Mathematics 2025-12-17 Imre Barany , Julia Q. Du , Dan Schwarz , Liping Yuan , Tudor Zamfirescu

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Andras Szenes

For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…

Combinatorics · Mathematics 2025-05-20 Frank a Campo

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

Let $P$ be a set of $n$ points in the plane, each point moving along a given trajectory. A {\em $k$-collinearity} is a pair $(L,t)$ of a line $L$ and a time $t$ such that $L$ contains at least $k$ points at time $t$, the points along $L$ do…

Computational Geometry · Computer Science 2011-05-17 Ben D. Lund , George B. Purdy , Justin W. Smith , Csaba D. Tóth

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

Combinatorics · Mathematics 2020-02-25 Aaron Lin , Konrad Swanepoel
‹ Prev 1 2 3 10 Next ›