Related papers: Higman operations on integer sequences, and embedd…
Recently, Cochran and Harvey defined torsion-free derived series of groups and proved an injectivity theorem on the associated torsion-free quotients. We show that there is a universal construction which extends such an injectivity theorem…
We redefine a multiplicative group structure on the set of equivalence classes of rational sequences satisfying a fixed linear recurrence of degree two, which was defined by R. R. Laxton in his paper "On groups of linear recurrences I"…
This article explains basic constructions and results on group algebras and their cohomology, starting from the point of view of commutative algebra. It provides the background necessary for a novice in this subject to begin reading Dave…
When undergraduates ask me what geometric group theorists study, I describe a theorem due to Gromov which relates the groups with an intrinsic geometry like that of the hyperbolic plane to those in which certain computations can be…
We summarize our latest developments in perturbative treating the effective theories of strong interactions. We discuss the principles of constructing the mathematically correct expressions for the S-matrix elements at a given loop order…
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag…
A prefix monoid is a finitely generated submonoid of a finitely presented group generated by the prefixes of its defining relators. Important results of Guba (1997), and of Ivanov, Margolis and Meakin (2001), show how the word problem for…
Several important cases of vector bundles with extra structure (such as Higgs bundles and triples) may be regarded as examples of twisted representations of a finite quiver in the category of sheaves of modules on a variety/manifold/ringed…
This paper is a survey on the works [MS77, MS79, MS81] on maximal subgroups in finitely generated linear groups, and the works that followed it [GG08, GG13b, GG13a, Kap03, Iva92, HO16, GM16, AGS14, Sf90, Sf98, Per05, AKT16, FG18, GS17]…
Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…
The theory of iterated monodromy groups was developed by Nekrashevych. It is a wonderful example of application of group theory in dynamical systems and, in particular, in holomorphic dynamics. Iterated monodromy groups encode in a…
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 aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
Recent results on finite open group transformations are reviewed.
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
Following a question of K. Hori at K. Fukaya's 60th birthday conference, we relate the recently established WDVV-type relations for real Gromov-Witten invariants to topological recursion relations in a real setting. We also describe…
This is an expository article on recent developments in the theory of group relaxations in integer programming from an algebraic perspective.
For a countable group G = <A | R> presented by its generators A and defining relations R we discuss a simple method to embed G into such a 2-generator group T that the images of generators from A are explicitly given in T, and the defining…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…