English
Related papers

Related papers: Popular differences for right isosceles triangles

200 papers

Suppose that G is an abelian group and A is a finite subset of G containing no three-term arithmetic progressions. We show that |A+A| >> |A|(log |A|)^{1/3-\epsilon} for all \epsilon>0.

Number Theory · Mathematics 2010-04-02 Tom Sanders

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Number Theory · Mathematics 2007-05-23 Ernie Croot

We prove the following conjecture of Shkredov and Solymosi: every subset $A \subset \mathbf{Z}^2$ such that $\sum_{a\in A\setminus\{0\}} 1/\left\|a\right\|^{2} = +\infty$ contains the three vertices of an isosceles right triangle. To do…

Combinatorics · Mathematics 2022-12-02 Cédric Pilatte

We show that if $A$ is a subset of a group of prime order $p$ such that $|2A|<2.7652|A|$ and $|A|<1.25\cdot10^{-6}p$, then $A$ is contained in an arithmetic progression with at most $|2A|-|A|+1$ terms, and $2A$ contains an arithmetic…

Number Theory · Mathematics 2023-02-17 Vsevolod F. Lev , Oriol Serra

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

Computational Geometry · Computer Science 2022-10-04 Ruy Fabila-Monroy , Carlos Hidalgo-Toscano , Daniel Perz , Birgit Vogtenhuber

We show any subset $A\subset\mathbb{N}$ with positive upper Banach density contains the pattern $\{m,m+[n\alpha],\dots,m+k[n\alpha]\}$, for some $m\in\mathbb{N}$ and $n=p-1$ for some prime $p$, where…

Dynamical Systems · Mathematics 2015-07-08 Wenbo Sun

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

Combinatorics · Mathematics 2007-05-23 Ben Green

A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…

Combinatorics · Mathematics 2023-05-05 Manik Dhar , Zeev Dvir , Ben Lund

An old theorem of Alexander Soifer's is the following: Given five points in a triangle of unit area, there must exist some three of them which form a triangle of area 1/4 or less. It is easy to check that this is not true if "five" is…

Combinatorics · Mathematics 2010-09-23 Matthew Kahle

The following combinatorial conjecture arises naturally from recent ergodic-theoretic work of Ackelsberg, Bergelson, and Best. Let $M_1$, $M_2$ be $k\times k$ integer matrices, $G$ be a finite abelian group of order $N$, and $A\subseteq…

Combinatorics · Mathematics 2022-06-03 Aaron Berger , Ashwin Sah , Mehtaab Sawhney , Jonathan Tidor

For a set $A$ of points in the plane, not all collinear, we denote by ${\rm tr}(A)$ the number of triangles in any triangulation of $A$; that is, ${\rm tr}(A) = 2i+b-2$ where $b$ and $i$ are the numbers of points of $A$ in the boundary and…

Combinatorics · Mathematics 2020-08-25 Károly J. Böröczky , Máté Matolcsi , Imre Z. Ruzsa , Francisco Santos , Oriol Serra

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

Combinatorics · Mathematics 2020-03-11 Chuanqi Xiao , Gyula O. H. Katona

The Abelian semigroup expansion is a powerful and simple method to derive new Lie algebras from a given one. Recently it was shown that the $S$-expansion of $\mathfrak{so}\left( 3,2\right) $ leads us to the Maxwell algebra $\mathcal{M}$. In…

High Energy Physics - Theory · Physics 2014-08-14 P. K. Concha , E. K. Rodríguez

Fix $\alpha \in (0,1/3)$. We show that, from a topological point of view, almost all sets $A\subseteq \mathbb{N}$ have the property that, if $A^\prime=A$ for all but $o(n^{\alpha})$ elements, then $A^\prime$ is not a nontrivial sumset…

Number Theory · Mathematics 2022-12-29 Paolo Leonetti

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 show that the number of unit-area triangles determined by a set $S$ of $n$ points in the plane is $O(n^{20/9})$, improving the earlier bound $O(n^{9/4})$ of Apfelbaum and Sharir [Discrete Comput. Geom., 2010]. We also consider two…

Combinatorics · Mathematics 2015-04-14 Orit E. Raz , Micha Sharir

Let $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$\delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq…

Number Theory · Mathematics 2009-04-23 Itziar Bardaji , David J. Grynkiewicz

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

Combinatorics · Mathematics 2016-11-29 Shanshan Du , Hao Pan

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

Number Theory · Mathematics 2013-08-06 Renling Jin

A subset of $\mathbb{F}_q^2$ is called an arc if it does not contain three collinear points. We show that there are at most $\binom{(1 + o(1))q}{m}$ arcs of size $m \gg q^{1/2} (\log q)^{3/2}$, nearly matching a trivial lower bound…

Combinatorics · Mathematics 2024-10-30 Rajko Nenadov