相关论文: Finitely presented subgroups of automatic groups a…
We present novel constructions concerning the homology of finitely generated groups. Each construction draws on ideas of Gilbert Baumslag. There is a finitely presented acyclic group $U$ such that $U$ has no proper subgroups of finite index…
In this thesis we investigate the Dehn functions of two different classes of groups: subdirect products, in particular subdirect products of limit groups; and Bestvina-Brady groups. Let D = \Gamma_1 \times ... \times \Gamma_n be a direct…
We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
A generalized Stiefel manifold is the manifold of orthonormal frames in a vector space with a non-degenerated bilinear or hermitian form. In this article, the Isometry group of the generalized Stiefel manifolds are computed at least up to…
We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…
We consider finitely presented,residually finite groups $G$ and finitely generated normal subgroups $A$ such that the inclusion $A\hookrightarrow G$ induces an isomorphism from the profinite completion of $A$ to a direct factor of the…
It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…
For any torsion-free hyperbolic group $\Gamma$ and any group $G$ that is fully residually $\Gamma$, we construct algorithmically a finite collection of homomorphisms from $G$ to groups obtained from $\Gamma$ by extensions of centralizers,…
Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…
We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
Every countable group that does not contain a finitely generated subgroup of exponential growth imbeds in a finitely generated group of subexponential growth. This produces in particular the first examples of groups of subexponential growth…
We show that any isometric action of a residually finite group admits approximate local finite models. As a consequence, if $G$ is residually finite, every isometric $G$-action embeds isometrically into a metric ultraproduct of finite…
A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…
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…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…