The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining relations. The relations must satisfy three types of axioms. The major one among them is called the Small Cancellation Axiom. We show that the obtained ring is non-trivial. Moreover, we show that this ring enjoys a global filtration that agrees with relations, find a basis of the ring as a vector space and establish the corresponding structure theorems. It turns out that the defined ring possesses a kind of Gröbner basis and a greedy algorithm. Finally, this ring can be used as a first step towards the iterated small cancellation theory which hopefully plays a similar role in constructing examples of rings with exotic properties as small cancellation groups do in group theory. Joint results with A. Kanel-Belov, E. Plotkin, E. Rips.
Tag - Infinite groups
I will show how to construct field extensions with Galois groups isomorphic to general linear groups (with entries in various rings and fields) from the torsion of elliptic curves and Drinfeld modules. No prior knowledge of these structures is assumed.
It is well-known that the Galois group of an (infinite) algebraic field extension is a profinite group. When the extension is transcendental, the automorphism group is no longer compact, but has a totally disconnected locally compact structure (TDLC for short). The study of TDLC groups was initiated by van Dantzig in 1936 and then restarted by Willis in 1994. In this talk some of Willis' concepts, such as tidy subgroups, the scale function, flat subgroups and directions are introduced and applied to examples of automorphism groups of transcendental field extensions. It remains unknown whether there exist conditions that a TDLC group must satisfy to be a Galois group. A suggestion of such a condition is made.
The Dehn function was introduced by computer scientists Madlener and Otto to describe the complexity of the word problem of a group, and also by Gromov as a geometric invariant of finitely presented groups. In this talk, I will show that the upper bound of the Dehn function of finitely presented metabelian group G is 2n2k, where k is the torsion-free rank of the abelianization Gab, answering the question that if the Dehn functions of metabelian groups are uniformly bounded. I will also talk about the relative Dehn function of finitely generated metabelian group and its relation to the Dehn function.
Dividing lines in complete first-order theories were introduced by Shelah in the early seventies. A dividing line is a property such that the classes satisfying such a property have some nice behaviour while those not satisfying it have a bad one. Two of the best understood dividing lines are those of stability and superstability.
In this talk, I will study the notion of stability and superstability in abstract elementary classes of modules with respect to pure embeddings, i.e., classes of the form (K,≤p) where K is a class of R-modules for a fixed ring R and ≤p is the pure submodule relation. In particular, using that the class of p-groups with pure embeddings is a stable AEC, I will present a solution to Problem 5.1 in page 181 of Abelian Groups by László Fuchs. Moreover, I will show how the notion of superstability can be used to give new characterizations of noetherian rings, pure-semisimple rings, and perfect rings.
Topological full groups of minimal subshifts are an important source of exotic examples in geometric group theory, as well as being powerful invariants of symbolic dynamical systems. In 2011, Grigorchuk and Medynets proved that TFGs are LEF, that is, every finite subset of the multiplication table occurs in the multiplication table of some finite group. In this talk we explore some ways in which asymptotic properties of the finite groups which occur reflect asymptotic properties of the associated subshift.
We modify the notion of a Fraïssé class and show that various interesting classes of groups, notably the class of non-abelian limit groups and the class of finitely generated elementary free groups, admit Fraïssé limits. We will also discuss countable elementary free groups.
We consider irrational slope versions of T and V. We give infinite presentations for these groups and show how they can be represented by tree-pair diagrams. We also show that they have index-2 normal subgroups that are simple.
There has been a long interest in embedding and non-embedding results for groups in the Thompson family. One way to get at results of this form is to classify maximal subgroups. In this talk, we will define certain labellings of binary trees and use them to produce a large family of new maximal subgroups of Thompson's group V. We also relate them to a conjecture about Thompson's group T.
A self-similar group is a group G acting on the Cayley graph of a finitely generated free monoid X* (i.e., a regular rooted tree) by automorphisms in such a way that the self-similarity of the tree is reflected in the group. The most common examples are generated by the states of a finite automaton. Many famous groups like Grigorchuk's 2-group of intermediate growth are of this form. Nekrashevych associated C*-algebras and algebras with coefficients in a field to self-similar groups. In the case G is trivial, the algebra is the classical Leavitt algebra, a famous finitely presented simple algebra. Nekrashevych showed the algebra associated to the Grigorchuk group is not simple in characteristic 2, but Clark, Exel, Pardo, Sims and Starling showed its Nekrashevych algebra is simple over all other fields. Nekrashevych then showed that the algebra associated to the Grigorchuk-Erschler group is not simple over any field (the first such example). The Grigorchuk and Grigorchuk-Erschler groups are contracting self-similar groups. This important class of self-similar groups includes Gupta-Sidki p-groups and many iterated monodromy groups like the Basilica group. Nekrashevych proved algebras associated to contacting groups are finitely presented.
In this talk we discuss a recent result of the speaker and N. Szakacs (York/Szeged) characterizing simplicity of Nekrashevych algebras of contracting groups. In particular, we give an algorithm for deciding simplicity given an automaton generating the group. We apply our results to several families of contracting groups like Gupta-Sidki groups and Sunic's generalizations of Grigorchuk's group associated to polynomials over finite fields.

You must be logged in to post a comment.