Related papers: On a generalization of Dehn's algorithm
Consider the following classes of pairs consisting of a group and a finite collection of subgroups: $\mathcal{C}= \left\{ (G,\mathcal H) \mid \text{$\mathcal{H}$ is hyperbolically embedded in $G$} \right\}$ and $ \mathcal{D}= \left\{…
In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…
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…
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…
We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
In this note, we study the notion of random Dehn function and compute an asymptotic upper bound for finitely presented acylindrically hyperbolic groups whose Dehn function is at most polynomial. By showing that in these cases, if the group…
The paper contains generalization of the renormgroup algorithm for boundary value problems of mathematical physics and related concept of the renormgroup symmetry, formulated earlier by authors with reference to models based on differential…
We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…
We consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
In this article, we extend Anderson's higher-dimensional Dehn filling construction to a large class of infinite-volume hyperbolic manifolds. This gives an infinite family of topologically distinct asymptotically hyperbolic Einstein…
Given any pair of positive integers m and n, we construct a new Hopf algebra, which may be regarded as a degenerate version of the quantum group of gl(m+n). We study its structure and develop a highest weight representation theory. The…
In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…
This Thesis presents a 2-dimensional generalization of Houghtons' groups H_n. H_n is defined to be the group of all permutations p of a disjoint union of copies of the natural numbers N, with the property that each copy of N contains a…
The renormalization group is a tool that allows one to obtain a reduced description of systems with many degrees of freedom while preserving the relevant features. In the case of quantum systems, in particular, one-dimensional systems…
Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…
Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) and this enables one program to address a wide range of…
We prove super-quadratic lower bounds for the growth of the filling area function of a certain class of Carnot groups. This class contains groups for which it is known that their Dehn function grows no faster than $n^2\log n$. We therefore…
We establish the existence, finiteness, and uniqueness up to scaling of various isoperimetric profiles of a group, in all dimensions. We also show that these profiles all coincide in dimensions 4 and higher; in particular, the nth Dehn…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…