Related papers: A combinatorial proof of the Removal Lemma for Gro…

The purpose of this paper is to generalize the classical Mazur's lemma from the classical convex analysis to the framework of locally $L^0$-convex modules. In this version an extra condition of countable concatenation is included. We…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

In this paper, we study the problem of removing an element from an additive basis in a general abelian group. We introduce analogues of the classical functions $X$, $S$ and $E$ (defined in the case of the integers) and obtain bounds on…

This paper develops some general results about actions of finite groups on (infinite) abelian groups in the finite Morley rank category. They are linked to a range of problems on groups of finite Morley rank discussed in [16]. Crucially,…

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…

The paper offers versions of Hilbert's Irreducibility Theorem for the lifting of points in a cyclic subgroup of an algebraic group to a ramified cover. A version of Bertini Theorem in this context is also obtained.

We present a rather general version of the snake lemma for abelian groups.

Additive combinatorics is built around the famous theorem by Szemer\'edi which asserts existence of arithmetic progressions of any length among the integers. There exist several different proofs of the theorem based on very different…

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 give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B. Szegedy: Szemer\'edi's Lemma for the analyst, Geometric…

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…

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…

We show that elementary abelian direct factors can be disregarded in the study of the modular isomorphism problem. Moreover, we obtain four new series of abelian invariants of the group base in the modular group algebra of a finite…

We study a notion of curvature for finitely generated groups which serves as a role of Ricci curvature for Riemannian manifolds. We prove an analog of Cheeger-Gromoll splitting theorem. As a consequence, we give a geometric characterization…

Inspired by an extension of Wiener's lemma on the relation of measures $\mu$ on the unit circle and their Fourier coefficients $\widehat{\mu}(k_n)$ along subsequences $(k_n)$ of the natural numbers by Cuny, Eisner and Farkas [CEF19,…

We generalize a well known periodicity lemma from the case of free groups to the case of acylindrically hyperbolic groups. This generalization will be used later to describe solutions of certain equations in acylindrically hyperbolic groups…

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

We give a short proof of Chevalley's theorem that every algebraic group is an extension of an Abelian variety by a linear algebraic group. Along the way we treat Bertini's irreducibility theorem.