Related papers: Generalized Small Cancellation Presentations for A…
We develop a theory of generalized presentations of groups. We give generalized presentations of the symmetric group $\Sigma(X)$ for an arbitrary set $X$ and of the automorphism group of the free group of countable rank, $Aut(F_{\omega})$.
We develop a version of small cancellation theory in the variety of Burnside groups. More precisely, we show that there exists a critical exponent $n_0$ such that for every odd integer $n\geq n_0$, the well-known classical $C'(1/6)$-small…
We generalize the small cancellation theory over hyperbolic groups developed by Olshanskii to the case of relatively hyperbolic groups. This allows us to construct infinite finitely generated groups with exactly $n$ conjugacy classes for…
Asymptotic properties of finitely generated subgroups of free groups, and of finite group presentations, can be considered in several fashions, depending on the way these objects are represented and on the distribution assumed on these…
We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…
We provide examples of classical small-cancellation groups which have non-sigma-compact Morse boundary. These are first known examples of groups with non-sigma-compact Morse boundary. Some small-cancellation groups do have sigma-compact…
In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that…
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
Gromov (2003) constructed finitely generated groups whose Cayley graphs contain all graphs from a given infinite sequence of expander graphs of unbounded girth and bounded diameter-to-girth ratio. These so-called Gromov monster groups…
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…
In Grayson's combinatorial description of higher K-groups, the generators are bounded acyclic binary multi-complexes of arbitrary size. Generalising work by Kasprowski, Winges and the author, we show in this paper that multi-complexes of…
We define the notion of $D$-set in an arbitrary semigroup, and with some mild restrictions we establish its dynamical and combinatorial characterizations. Assuming a weak form of cancellation in semigroups we have shown that the Cartesian…
A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…
Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs. Generalized semiautomata are obtained from stochastic semiautomata by dropping the restrictions imposed by…
We introduce three forms of generalized contraction (GC). Roughly speaking, these are motivated by allowing contraction to take place after small transients in time and/or amplitude. Indeed, contraction is usually used to prove asymptotic…
We generalize a version of small cancellation theory to the class of acylindrically hyperbolic groups. This class contains many groups which admit some natural action on a hyperbolic space, including non-elementary hyperbolic and relatively…
We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…
This paper addresses a decision problem highlighted by Grigorchuk, Nekrashevich, and Sushchanskii, namely the finiteness problem for automaton (semi)groups. For semigroups, we give an effective sufficient but not necessary condition for…
We show that every finite group realizes as the outer automorphism group of an ICC hyperbolic group with Kazhdan property (T). This result complements the well-known theorem of Paulin stating that the outer automorphism group of every…