Related papers: A combinatorial proof of the Removal Lemma for Gro…
We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…
We prove a version for mixed groups for a Fuchs' result about connections between the cancellation property of a group and the unit lifting property of its (Walk-)endomorphism rings.
Expansions of abelian categories are introduced. These are certain functors between abelian categories and provide a tool for induction/reduction arguments. Expansions arise naturally in the study of coherent sheaves on weighted projective…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
In this paper, we revisit the 1979 work of Isbell on subfactors of groups and their projections, which he uses to establish a stronger formulation of the butterfly lemma and its consequence, the refinement theorem for subnormal series of…
Write $\mathbf{A}_\lambda$ for what might be described as the most elementary nontrivial inverse system of abelian groups indexed by the functions from the cardinal $\lambda$ to the set of natural numbers. The question of whether for any…
We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…
Let G be a finite Abelian group and A be a subset G\times G of cardinality at least |G|^2/(log log |G|)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d does not equal 0. This…
We give a combinatorial proof of a theorem of Gromov, which extends the scope of small cancellation theory to group presentations arising from labelled graphs.
For an abelian category and a distinguished object with a graded endomorphism ring a necessary and sufficient criterion is given so that the category is equivalent to the abelian quotient of the category of finitely presented graded modules…
In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.
We give a new proof of a lemma by L. Shepp, that was used in connection to random coverings of a circle.
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…
The presented splitting lemma extends the techniques of Gromov and Forstneri\v{c} to glue local sections of a given analytic sheaf, a key step in the proof of all Oka principles. The novelty on which the proof depends is a lifting lemma for…
For a reductive group scheme over a regular semi-local ring, we prove an equivarinat version of the Gersten conjecture. We draw some interesting consequences for the representation rings of such reductive group schemes. We also prove the…
For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…
The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…
This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…
We calculate the formal group law which represents the completion of the N\'eron model of an algebraic torus over the rationals that splits in a tamely ramified abelian extension. As a tools in the proof, we define and give criterions to…