English
Related papers

Related papers: General removal lemma

200 papers

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…

Combinatorics · Mathematics 2007-05-23 Terence Tao

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…

Combinatorics · Mathematics 2025-06-04 Lior Gishboliner , Asaf Shapira

We state and prove a Lemma in 1 variable Calculus, that justifies some arguments previously used to ilustrate non-uniqueness of some generalized physical quantities.

General Mathematics · Mathematics 2007-05-23 P. G. A. Braz e Silva , A. R. R. Papa

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…

Combinatorics · Mathematics 2012-11-16 David Conlon , Jacob Fox

We study the integral and measure theory of the ultraproduct of finite sets. As a main application we construct limit objects for hypergraph sequences. We give a new proof for the Hypergraph Removal Lemma and the Hypergraph Regularity…

Combinatorics · Mathematics 2007-05-23 Gabor Elek , Balazs Szegedy

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$…

Combinatorics · Mathematics 2008-09-11 Dan Král' , Oriol Serra , Lluís Vena

The General Curve Lemma is a tool of Infinite-Dimensional Analysis, which enables refined studies of differentiability properties of mappings between real locally convex spaces. In this article, we generalize the General Curve Lemma in two…

Functional Analysis · Mathematics 2007-05-23 Helge Glockner

We give a brief account and a simpler proof of a contour integral formula for the Gauss hypergeometric function. Such formula is alternative to Barnes's integral formula and generalizes the first Barnes Lemma.

Complex Variables · Mathematics 2019-02-07 Raffaele Marcovecchio

Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…

Logic · Mathematics 2014-12-30 Ashwini Aroskar , James Cummings

We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim…

Combinatorics · Mathematics 2015-05-12 Lluís Vena

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…

Combinatorics · Mathematics 2021-01-26 Henry Towsner

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…

Combinatorics · Mathematics 2008-05-01 Daniel Král' , Oriol Serra , Lluís Vena

In this work, we prove a general version of the reduction lemmas for eigenfunctions of graphs admitting involutive automorphisms of a special type.

Combinatorics · Mathematics 2023-05-23 Alexandr Valyuzhenich

We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs,…

Combinatorics · Mathematics 2017-11-01 Yoshiharu Kohayakawa , Guilherme O. Mota , Mathias Schacht , Anusch Taraz

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…

Combinatorics · Mathematics 2011-01-04 Jacob Fox

We study a cut-off function lemma in projective spaces. We believe that this is well-known. We provide the details of the computation for later uses.

Complex Variables · Mathematics 2012-05-24 Taeyong Ahn

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.

Combinatorics · Mathematics 2011-09-15 Pablo Candela , Olof Sisask

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…

Combinatorics · Mathematics 2008-09-17 Balazs Szegedy

In this paper, we mainly propose improvements of the logarithmic difference lemma for meromorphic functions in several complex variables, and then investigate meromorphic solutions of partial difference equations from the viewpoint of…

Complex Variables · Mathematics 2019-09-10 Tingbin Cao , Ling Xu

In the present paper, we generalize the well-known Hensel's lifting lemma to any continuous function $f : \mathbb{Z}_p\rightarrow \mathbb{Z}_p$. This answers a question posed by Axelsson and Khrennikov (2016) who showed the validity of…

Commutative Algebra · Mathematics 2018-06-21 Hajime Kaneko , Thomas Stoll
‹ Prev 1 2 3 10 Next ›