English
Related papers

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

200 papers

Let $L$ be a set of $n$ lines in $R^3$ that is contained, when represented as points in the four-dimensional Pl\"ucker space of lines in $R^3$, in an irreducible variety $T$ of constant degree which is \emph{non-degenerate} with respect to…

Combinatorics · Mathematics 2022-02-11 Micha Sharir , Noam Solomon

In this note we consider two simplicial arrangements of lines and ideals $I$ of intersection points of these lines. There are $127$ intersection points in both cases and the numbers $t_i$ of points lying on exactly $i$ configuration lines…

Algebraic Geometry · Mathematics 2018-12-12 Marek Janasz , Magdalena Lampa-Baczyńska , Grzegorz Malara

Given a finite point set $P$ in the plane, a subset $S \subseteq P$ is called an island in $P$ if $conv(S) \cap P = S$. We say that $S\subset P$ is a visible island if the points in $S$ are pairwise visible and $S$ is an island in $P$. The…

Combinatorics · Mathematics 2022-02-15 Sophie Leuchtner , Carlos M. Nicolas , Andrew Suk

We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…

Functional Analysis · Mathematics 2021-04-02 Wei Zhan

In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…

Dynamical Systems · Mathematics 2026-03-11 Felipe Hernández

We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…

Combinatorics · Mathematics 2015-09-25 Tristram C. Bogart , Edward D. Kim

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao

There exists an absolute constant $\delta > 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - \delta}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| >…

Combinatorics · Mathematics 2018-11-15 Brendan Murphy , Giorgis Petridis

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

Classical Analysis and ODEs · Mathematics 2023-07-04 Xuezhi Chen , Jingwei Guo

For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…

Dynamical Systems · Mathematics 2025-09-16 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

Differential Geometry · Mathematics 2007-05-23 Jean-Marc Schlenker

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

Number Theory · Mathematics 2008-12-06 Hongze Li , Hao Pan

For integers $k\geq 3,d\geq 2,$ we consider the abundance property of pinned $k$-point patterns occurring in $E\subseteq \mathbb R^d$ with positive upper density $\delta(E)$. We show that for any fixed $k$-point pattern $V$, there is a set…

Combinatorics · Mathematics 2025-10-28 Chenjian Wang

We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…

Group Theory · Mathematics 2026-04-01 Tom Hutchcroft , Nicolas Monod , Omer Tamuz

A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the…

Logic · Mathematics 2010-11-18 Hans Adler , Isolde Adler

We construct infinite sequences of pseudo-Anosov homeomorphisms without fixed points and leaving invariant a sequence of orientable measured foliations on the same topological surface and the same stratum of the space of abelian…

Dynamical Systems · Mathematics 2009-08-24 Jérôme Los

In each manifold $M$ modeled on a finite or infinite dimensional cube $[0,1]^n$ we construct a closed nowhere dense subset $S\subset M$ (called a spongy set) which is a universal nowhere dense set in $M$ in the sense that for each nowhere…

Geometric Topology · Mathematics 2014-10-01 Taras Banakh , Dusan Repovs

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. In this paper we consider the following three general questions: (i) What is the size…

Combinatorics · Mathematics 2016-10-20 Robert Hancock , Andrew Treglown

We improve the best known upper bound on the density of a planar measurable set A containing no two points at unit distance to 0.25442. We use a combination of Fourier analytic and linear programming methods to obtain the result. The…

Metric Geometry · Mathematics 2020-12-15 Gergely Ambrus , Máté Matolcsi

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…

Computational Geometry · Computer Science 2011-11-10 Mridul Aanjaneya , Monique Teillaud