相关论文: A tight bound for Green's arithmetic triangle remo…

We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group $\mathbb{F}_2^n$. A triangle in $\mathbb{F}_2^n$ is a triple $(x,y,z)$ such that $x+y+z = 0$. The triangle removal lemma for…

For each $k\geq 3$, Green proved an arithmetic $k$-cycle removal lemma for any abelian group $G$. The best known bounds relating the parameters in the lemma for general $G$ are of tower-type. For $k>3$, even in the case $G=\mathbb{F}_2^n$…

A common theme in many extremal problems in graph theory is the relation between local and global properties of graphs. One of the most celebrated results of this type is the Ruzsa-Szemer\'edi triangle removal lemma, which states that if a…

We construct $n$-vertex graphs $G$ where $\epsilon n^2$ edges must be deleted to become triangle-free, which contain less than $\epsilon^{(C_{\text{new}}-o(1))\log_2 1/\epsilon}n^3$ triangles for $C_{\text{new}}= \frac{1}{4\log_2(4/3)}…

Green proved an arithmetic analogue of Szemer\'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that…

Green used an arithmetic analogue of Szemer\'edi's celebrated regularity lemma to prove the following strengthening of Roth's theorem in vector spaces. For every $\alpha>0$, $\beta<\alpha^3$, and prime number $p$, there is a least positive…

For a prime $p$, a restricted arithmetic progression in $\mathbb{F}_p^n$ is a triplet of vectors $x, x+a, x+2a$ in which the common difference $a$ is a non-zero element from $\{0,1,2\}^n$. What is the size of the largest $A\subseteq…

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…

Green developed an arithmetic regularity lemma to prove a strengthening of Roth's theorem on arithmetic progressions in dense sets. It states that for every $\epsilon > 0$ there is some $N_0(\epsilon)$ such that for every $N \ge…

The triangle removal states that if $G$ contains $\varepsilon n^2$ edge-disjoint triangles, then $G$ contains $\delta(\varepsilon)n^3$ triangles. Unfortunately, there are no sensible bounds on the order of growth of $\delta(\varepsilon)$,…

We study quantitative relationships between the triangle removal lemma and several of its variants. One such variant, which we call the triangle-free lemma, states that for each $\epsilon>0$ there exists $M$ such that every triangle-free…

The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…

The clique removal lemma says that for every $r \geq 3$ and $\varepsilon>0$, there exists some $\delta>0$ so that every $n$-vertex graph $G$ with fewer than $\delta n^r$ copies of $K_r$ can be made $K_r$-free by removing at most…

In this paper, we discuss some dimension results for triangle sets of compact sets in $\mathbb{R}^2$. In particular, we prove that for any compact set $F$ in $\mathbb{R}^2$, the triangle set $\Delta(F)$ satisfies \[ \dim_{\mathrm{A}}…

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

We consider a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i<j$ such that both $f$ and $g$ weakly increase on them, i.e., $f_i\le f_j$ and $g_i \le g_j$. By a combinatorial…

Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…