中文
相关论文

相关论文: Three Dimensional Corners: A Box Norm Proof

200 篇论文

A $P$-polynomial corner, for $P \in \mathbb{Z}[z]$ a polynomial, is a triple of points $(x,y),\; (x+P(z),y),\; (x,y+P(z))$ for $x,y,z \in \mathbb{Z}$. In the case where $P$ has an integer root of multiplicity $1$, we show that if $A…

组合数学 · 数学 2024-09-04 Noah Kravitz , Borys Kuca , James Leng

A corner is a set of three points in $\mathbf{Z}^2$ of the form $(x, y), (x + d, y), (x, y + d)$ with $d \neq 0$. We show that for infinitely many $N$ there is a set $A \subset [N]^2$ of size $2^{-(c + o(1)) \sqrt{\log_2 N}} N^2$ not…

组合数学 · 数学 2021-03-11 Ben Green

The Corners Theorem states that for any $\alpha > 0$ there exists an $N_0$ such that for any abelian group $G$ with $|G| = N \geq N_0$ and any subset $A \subset G \times G$ with $|A| \ge \alpha N^2$ we can find a corner in $A$ , i.e. there…

组合数学 · 数学 2023-06-22 Matei Mandache

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G \setminus \{0\}$ such that $(x, y)$, $(x+d, y)$, $(x, y+d) \in A$. We prove that \[|A| \le…

组合数学 · 数学 2025-07-15 Michael Jaber , Yang P. Liu , Shachar Lovett , Anthony Ostuni , Mehtaab Sawhney

Ramsey theory is a central and active branch of combinatorics. Although Ramsey numbers for graphs have been extensively investigated since Ramsey's work in the 1930s, there is still an exponential gap between the best known lower and upper…

组合数学 · 数学 2025-01-03 António Girão , Gal Kronenberg , Alex Scott

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…

组合数学 · 数学 2021-07-01 Aaron Berger

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0…

组合数学 · 数学 2014-02-26 Ben Green , Terence Tao

Let G be a finite Abelian group and A be a subset G\times G of cardinality at least |G|^2/(log log |G|)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d does not equal 0. This…

数论 · 数学 2007-05-23 I. D. Shkredov

For $B \subseteq \mathbb F_q^m$, the $n$-th affine extremal number of $B$ is the maximum cardinality of a set $A \subseteq \mathbb F_q^n$ with no subset which is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for any $B…

组合数学 · 数学 2023-08-28 Bryce Frederickson , Liana Yepremyan

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…

经典分析与常微分方程 · 数学 2023-07-04 Xuezhi Chen , Jingwei Guo

Let A \subseteq [1,..,N]^2 be a set of cardinality at least N^2/(log log N)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d>0. This theorem is a two-dimensional generalization of…

数论 · 数学 2007-05-23 I. D. Shkredov

In this paper we introduce the concept of corner element of a generalized numerical semigroup, which extends in a sense the idea of conductor of a numerical semigroup to generalized numerical semigroups in higher dimensions. We present…

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

组合数学 · 数学 2013-08-27 Guy Moshkovitz , Asaf Shapira

Let $\mathbb F_2^n$ be the finite field of cardinality $2 ^{n}$. For all large $n$, any subset $A\subset \mathbb F_2^n\times \mathbb F_2 ^n$ of cardinality \begin{equation*} \abs{A} \gtrsim 4^n \log\log n (\log n) ^{-1} \end{equation*} must…

组合数学 · 数学 2007-05-23 Michael T Lacey , William McClain

We start with a systematic study of the zero-sum Ramsey numbers. For a graph $G$ with $0 \ (\!\!\!\!\mod 3)$ edges, the zero-sum Ramsey number is defined as the smallest positive integer $R(G, \mathbb{Z}_3)$ such that for every $n \geq R(G,…

组合数学 · 数学 2025-02-07 Yair Caro , Xandru Mifsud

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

组合数学 · 数学 2007-05-23 Terence Tao

The Gowers U^3 norm is one of a sequence of norms used in the study of arithmetic progressions. If G is an abelian group and A is a subset of G then the U^3(G) of the characteristic function 1_A is useful in the study of progressions of…

数论 · 数学 2023-12-08 Ben Green , Terence Tao

This paper is the third part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

数论 · 数学 2024-07-29 Wenbo Sun

Define $r_4(N)$ to be the largest cardinality of a set $A \subset \{1,\dots,N\}$ which does not contain four elements in arithmetic progression. In 1998 Gowers proved that \[ r_4(N) \ll N(\log \log N)^{-c}\] for some absolute constant…

组合数学 · 数学 2017-08-11 Ben Green , Terence Tao

More than thirty years ago, Erd\H{o}s, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant $c_k$ such that $r(C_{2k+1}, G) \le c_k m$ for any graph $G$ with $m$ edges and no…

组合数学 · 数学 2026-03-31 Eng Keat Hng , Meng Ji , Ander Lamaison
‹ 上一页 1 2 3 10 下一页 ›