相关论文: On the removal lemma for linear configurations in …

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…

Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his…

We provide new examples of the asymptotic counting for the number of subsets on groups of given size which are free of certain configurations. These examples include sets without solutions to equations in non-abelian groups, and linear…

In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the $k$--determinantal of an integer $(k\times m)$ matrix $A$ is coprime with the order $n$ of a group $G$ and the…

We obtain a removal lemma for systems of linear equations over the circle group, using a similar result for finite fields due to Kr\'al, Serra and Vena, and we discuss some applications.

We prove a removal lemma for systems of linear equations over finite fields: let $X_1,...,X_m$ be subsets of the finite field $\F_q$ and let $A$ be a $(k\times m)$ matrix with coefficients in $\F_q$ and rank $k$; if the linear system $Ax=b$…

In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemer\'edi's…

Recent work of Gowers and Nagle, R\"odl, Schacht, and Skokan has established a hypergraph removal lemma, which in turn implies some results of Szemer\'edi and Furstenberg-Katznelson concerning one-dimensional and multi-dimensional…

We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…

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…

Given a fixed $k$-uniform hypergraph $F$, the $F$-removal lemma states that every hypergraph with few copies of $F$ can be made $F$-free by the removal of few edges. Unfortunately, for general $F$, the constants involved are given by…

We formulate and prove a general result in spirit of hypergraph removal lemma for measurable functions of several variables.

We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was…

The graph removal lemma states that any graph on n vertices with o(n^{v(H)}) copies of a fixed graph H may be made H-free by removing o(n^2) edges. Despite its innocent appearance, this lemma and its extensions have several important…

Let $G$ be an abelian group of bounded exponent and $A \subseteq G$. We show that if the collection of translates of $A$ has VC dimension at most $d$, then for every $\epsilon>0$ there is a subgroup $H$ of $G$ of index at most…

We prove a removal lemma for induced ordered hypergraphs, simultaneously generalizing Alon--Ben-Eliezer--Fischer's removal lemma for ordered graphs and the induced hypergraph removal lemma. That is, we show that if an ordered hypergraph…

We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(n^h) copies of H can be made H-free by removing o(n^2) edges. We give a new proof which avoids Szemer\'edi's regularity lemma and…

Modeling potential alloys requires the exploration of all possible configurations of atoms. Additionally, modeling the thermal properties of materials requires knowledge of the possible ways of displacing the atoms. One solution to finding…

Obtaining an efficient bound for the triangle removal lemma is one of the most outstanding open problems of extremal combinatorics. Perhaps the main bottleneck for achieving this goal is that triangle-free graphs can be highly unstructured.…