English
Related papers

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

200 papers

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Zeev Dvir , Shubhangi Saraf , Charles Wolf

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

Combinatorics · Mathematics 2018-12-27 Sara Fish , Ben Lund , Adam Sheffer

We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…

Dynamical Systems · Mathematics 2007-05-23 David Richeson , Jim Wiseman

This paper introduces a notion of regularity (or irregularity) of the point at infinity for the unbounded open subset of $\rr^{N}$ concerning second order uniformly elliptic equations with bounded and measurable coefficients, according as…

Analysis of PDEs · Mathematics 2015-06-09 Ugur G. Abdulla

Let k be a number field, let E/k be an elliptic curve, and let S be a finite set of places of k contianing the archimedean places. Let F be an algebraic closure of k. We prove that if a point P in E(F) is nontorsion, then there are only…

Number Theory · Mathematics 2016-09-07 Matthew Baker , Su-Ion Ih , Robert Rumely

We prove that a poset with no induced subposet $S_k$ (for fixed $k\geq 3$) must have dimension that is sublinear in terms of the number of elements.

Combinatorics · Mathematics 2013-11-27 Csaba Biro , Peter Hamburger , Attila Por

We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…

Computational Geometry · Computer Science 2025-06-10 Philipp Kindermann , Jan Kratochvíl , Giuseppe Liotta , Pavel Valtr

Let $Y$ be a compact metric space, $G$ be a group acting by transformations on $Y$. For any infinite subset $A\subset Y$, we study the density of $gA$ for $g\in G$ and quantitative density of the set $\displaystyle{\bigcup_{g\in G_n}gA}$ by…

Dynamical Systems · Mathematics 2017-09-19 Changguang Dong

Ulam asked in 1945 if there is an everywhere dense \emph{rational set}, i.e. a point set in the plane with all its pairwise distances rational. Erd\H os conjectured that if a set $S$ has a dense rational subset, then $S$ should be very…

Combinatorics · Mathematics 2014-04-22 Jozsef Solymosi , Frank de Zeeuw

It is known that every homeomorphism of the plane has a fixed point in a non-separating, invariant subcontinuum. Easy examples show that a branched covering map of the plane can be periodic point free. In this paper we show that any…

General Topology · Mathematics 2016-01-25 A. Blokh , L. Oversteegen

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

Computational Geometry · Computer Science 2020-09-30 Boris Aronov , Esther Ezra , Micha Sharir

Erd\H{o}s conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erd\H{o}s' conjecture in the case that $A$ has…

Number Theory · Mathematics 2016-05-06 Mauro Di Nasso , Isaac Goldbring , Renling Jin , Steven Leth , Martino Lupini , Karl Mahlburg

If S is a set of q+2 points in P^2(F_q) such that some point of S is not on any line containing two other points of S, then in suitable coordinates S has the form S_f:={(c:f(c):1) : c in F_q} U {(1:0:0),(0:1:0)} for some f(X) in F_q[X]. Let…

Combinatorics · Mathematics 2023-09-21 Zhiguo Ding , Michael E. Zieve

An infinite $(p,q)$-theorem, or an $(\aleph_0,q)$-theorem, involving two families $\mathcal{F}$ and $\mathcal{G}$ of sets, states that if in every infinite subset of $\mathcal{F}$, there are $q$ sets that are intersected by some set in…

Combinatorics · Mathematics 2025-09-12 Sutanoya Chakraborty , Arijit Ghosh

We prove a no-dimensional version of Carath\'edory's theorem: given an $n$-element set $P\subset \Re^d$, a point $a \in \conv P$, and an integer $r\le d$, $r \le n$, there is a subset $Q\subset P$ of $r$ elements such that the distance…

Metric Geometry · Mathematics 2019-08-29 Karim Adiprasito , Imre Bárány , Nabil H. Mustafa , Tamás Terpai

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

We prove the joints conjecture, showing that for any $N$ lines in ${\Bbb R}^3$, there are at most $O(N^{{3 \over 2}})$ points at which 3 lines intersect non-coplanarly. We also prove a conjecture of Bourgain showing that given $N^2$ lines…

Combinatorics · Mathematics 2008-12-08 Larry Guth , Nets Hawk Katz

In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…

Combinatorics · Mathematics 2021-03-10 Daniel Horsley , Bridget S. Webb

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

In this article, we first describe all nonempty sets of integers S with the property that for all n and m in S, not necessarily distinct, the set {n-m,n+m} intersected with S consists of a single element. These are the sets with at most two…

Group Theory · Mathematics 2026-02-03 Artūras Dubickas , Chris Smyth
‹ Prev 1 3 4 5 6 7 10 Next ›