English
Related papers

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

200 papers

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

General Topology · Mathematics 2020-04-24 Gerald Kuba

A set of points with finite density is constructed in $\mathbb{R}^d$, with $d\geq2$, by adding points to a Poisson process such that any line segment of length $O\left(\varepsilon^{-(d-1)}\ln\varepsilon^{-1}\right)$ in $\mathbb{R}^d$ will…

Metric Geometry · Mathematics 2024-12-17 Kirill Kashkan

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

Combinatorics · Mathematics 2013-06-25 Tanya Khovanova , Sergei Konyagin

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

For every $d\ge 3$, we construct a noncompact smooth $d$-dimensional Riemannian manifold with strictly positive sectional curvature without isoperimetric sets for any volume below $1$. We construct a similar example also for the relative…

Differential Geometry · Mathematics 2024-05-30 Gioacchino Antonelli , Federico Glaudo

We give an upper bound for the number of points of a hypersurface over a finite field that has no lines on, in terms of the dimension, the degree, and the number of the elements of the finite field.

Algebraic Geometry · Mathematics 2014-10-14 Masaaki Homma

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines…

Combinatorics · Mathematics 2014-12-03 Zeev Dvir , Sivakanth Gopi

New partial results are obtained related to the following old problem of Erd\"os: for any infinite set $X$ of real numbers to show that there is always a measurable (or, equivalently, closed) subset of reals of positive Lebesgue measure…

Metric Geometry · Mathematics 2015-12-18 Miroslav Chlebik

Answering a question of P. Erdos from 1965, we show that for every eps>0 there is a set A of n integers with the following property: every subset A' of A with at least (1/3 + eps)n elements contains three distinct elements x,y,z with x + y…

Combinatorics · Mathematics 2014-11-10 Sean Eberhard , Ben Green , Freddie Manners

The paper deals with the solution of Shevrin ans Sapir problem. Infinite finitely presented nilsemigroup is constructed. The construction is based on aperiodic tilings, Goodman-Strauss type theorems on uniformly elliptic space. Space is…

Group Theory · Mathematics 2015-12-25 Ilya Ivanov-Pogodaev , Alexey Kanel-Belov

We consider the number of distinct distances between two finite sets of points in ${\bf R}^k$, for any constant dimension $k\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary…

Combinatorics · Mathematics 2016-12-16 Ariel Bruner , Micha Sharir

Suppose you have an uncomputable set $X$ and you want to find a set $A$, all of whose infinite subsets compute $X$. There are several ways to do this, but all of them seem to produce a set $A$ which is fairly sparse. We show that this is…

Logic · Mathematics 2023-08-15 Matthew Harrison-Trainor , Lu Liu , Patrick Lutz

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

Combinatorics · Mathematics 2013-09-25 József Solymosi , Miloš Stojaković

In this paper, we deal with a class of semilinear elliptic equation in a bounded domain $\Omega\subset\mathbb{R}^N$, $N\geq 3$, with $C\sp{1,1}$ boundary. Using a new fixed point result of the Krasnoselskii's type for the sum of two…

Analysis of PDEs · Mathematics 2007-05-23 Cleon S. Barroso

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

Combinatorics · Mathematics 2013-08-27 Adam Sheffer , Joshua Zahl , Frank de Zeeuw

Erd\"{o}s proved that for every infinite $X \subseteq \mathbb{R}^d$ there is $Y \subseteq X$ with $|Y|=|X|$, such that all pairs of points from $Y$ have distinct distances, and he gave partial results for general $a$-ary volume. In this…

Logic · Mathematics 2018-07-19 William Gasarch , Douglas Ulrich

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…

Metric Geometry · Mathematics 2022-02-03 Tongseok Lim , Robert J. McCann

We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of N such that its theory has models with no (elementary) end extensions. In fact there is a…

Logic · Mathematics 2010-06-08 Saharon Shelah

The main result of this paper is the following. Given countably many multivariate polynomials with rational coefficients and maximum degree $d$, we construct a compact set $E\subset \R^n$ of Hausdorff dimension $n/d$ which does not contain…

Classical Analysis and ODEs · Mathematics 2012-01-04 András Máthé

We prove three results concerning the existence of Bohr sets in threefold sumsets. More precisely, letting $G$ be a countable discrete abelian group and $\phi_1, \phi_2, \phi_3: G \to G$ be commuting endomorphisms whose images have finite…

Combinatorics · Mathematics 2023-06-08 John T. Griesmer , Anh N. Le , Thái Hoàng Lê