English
Related papers

Related papers: Lower bounds for corner-free sets

200 papers

A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).

Number Theory · Mathematics 2007-05-23 Ben Green

A set of integers $A$ is non-averaging if there is no element $a$ in $A$ which can be written as an average of a subset of $A$ not containing $a$. We show that the largest non-averaging subset of $\{1, \ldots, n\}$ has size $n^{1/4+o(1)}$,…

Combinatorics · Mathematics 2025-09-11 Huy Tuan Pham , Dmitrii Zakharov

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

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of…

Combinatorics · Mathematics 2025-09-09 Matěj Trödler , Jan Volec , Jan Vybíral

An arc in $\mathbb F_q^2$ is a set $P \subset \mathbb F_q^2$ such that no three points of $P$ are collinear. We use the method of hypergraph containers to prove several counting results for arcs. Let $\mathcal A(q)$ denote the family of all…

Combinatorics · Mathematics 2022-09-08 Krishnendu Bhowmick , Oliver Roche-Newton

Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a family of…

Computational Geometry · Computer Science 2012-08-15 Pradeesha Ashok , Umair Azmi , Sathish Govindarajan

We find all analytic surfaces in space $\mathbb{R}^3$ such that through each point of the surface one can draw two transversal circular arcs fully contained in the surface. The problem of finding such surfaces traces back to the works of…

Differential Geometry · Mathematics 2022-05-03 Mikhail Skopenkov , Rimvydas Krasauskas

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum number of such 1-handles is called the…

Geometric Topology · Mathematics 2013-05-21 Inasa Nakamura

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

It is known that, if $\Omega$ $\subset$ C is a convex set containing the numerical range of an operator A, then $\Omega$ is a C $\Omega$ -spectral set for A with C $\Omega$ $\le$ 1+ $\sqrt$ 2. We improve this estimate in unbounded cases.

Functional Analysis · Mathematics 2025-09-25 Michel Crouzeix

We prove a lower bound on the number of ordinary conics determined by a finite point set in $\mathbb{R}^2$. An ordinary conic for a subset $S$ of $\mathbb{R}^2$ is a conic that is determined by five points of $S$, and contains no other…

Combinatorics · Mathematics 2016-05-24 Thomas Boys , Claudiu Valculescu , Frank de Zeeuw

For a compact abelian group $G$, a corner in $G \times G$ is a triple of points $(x,y)$, $(x,y+d)$, $(x+d,y)$. The classical corners theorem of Ajtai and Szemer\'edi implies that for every $\alpha > 0$, there is some $\delta > 0$ such that…

Combinatorics · Mathematics 2021-07-01 Aaron Berger

We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…

Analysis of PDEs · Mathematics 2020-04-24 Annalisa Cesaroni , Matteo Novaga

Let $\mathcal{P}$ be a set of $n$ points in the Euclidean plane. We prove that, for any $\epsilon > 0$, either a single line or circle contains $n/2$ points of $\mathcal{P}$, or the number of distinct perpendicular bisectors determined by…

Combinatorics · Mathematics 2019-03-06 Ben Lund

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

Number Theory · Mathematics 2015-06-16 Kevin O'Bryant

A set without tangents in $\PG(2,q)$ is a set of points S such that no line meets S in exactly one point. An exterior set of a conic $\mathcal{C}$ is a set of points $\E$ such that all secant lines of $\E$ are external lines of…

Combinatorics · Mathematics 2012-01-04 Geertrui Van de Voorde

For a subset $A$ of $\{1,2,\ldots,N\}^2$ of size $\alpha N^2$ we show existence of $(m,n)\neq(0,0)$ such that the set $A$ contains at least $(\alpha^3 - o(1))N^2$ triples of points of the form $(a,b)$, $(a+m,b+n)$, $(a-n,b+m)$. This answers…

Combinatorics · Mathematics 2021-12-06 Vjekoslav Kovač

Given a finite point set $X$ in the plane, the degree of a pair $\{x,y\} \subset X$ is the number of empty triangles $t=conv\{x,y,z\}$, where empty means $t\cap X=\{x,y,z\}$. Define $deg X$ as the maximal degree of a pair in $X$. Our main…

Probability · Mathematics 2012-09-19 Imre Bárány , Jean-François Marckert , Matthias Reitzner