Related papers: A removal lemma for linear configurations in subse…
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$…
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…
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…
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 formulate and prove a general result in spirit of hypergraph removal lemma for measurable functions of several variables.
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…
We first generalize a curve selection lemma for Noetherian schemes and apply it to prove a version of Curve Selection Lemma in arc spaces, answering affirmatively a question by Reguera. Furthermore, thanks to a structure theorem of…
The vector system of linear differential equations for a field with arbitrary fractional spin is proposed using infinite-dimensional half-bounded unitary representations of the $\overline{SL(2,R)}$ group. In the case of $(2j+1)$-dimensional…
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…
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.
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…
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…
The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…
We discuss, on finite and infinite dimensional normed vector spaces, some versions of Radstr\"{o}m cancellation law (or lemma) that are suited for applications to set optimization problems. In this sense, we call our results "conic"…
Methods from learning theory are used in the state space of linear dynamical and control systems in order to estimate the system matrices. An application to stabilization via algebraic Riccati equations is included. The approach is…
Zalcman's Lemma makes significant applications in normal families, complex dynamics and related problems in complex analysis. In the present paper, we are devoted to generalizing the classical Zalcman's lemma to complex Lie groups by means…
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.
We present a method for constructing families of isospectral systems, using linear representations of finite groups. We focus on quantum graphs, for which we give a complete treatment. However, the method presented can be applied to other…
We prove Roth type theorems in finite groups. Our main tool is the Triangle Removal Lemma of Ruzsa and Szemer\'edi.
We give a complete solution of the linearization problem in the plane Cremona group over an algebraically closed field of characteristic zero.