Related papers: On the difficulty of presenting finitely presentab…
Motivated by quotient algorithms, such as the well-known $p$-quotient or solvable quotient algorithms, we describe how to compute extensions $\tilde H$ of a finite group $H$ by a direct sum of isomorphic simple $\mathbb{Z}_p H$-modules such…
Consider the unit ball, B = D x [0,1], containing n unknotted arcs a_1, ... a_n such that the boundary of each a_i lies in D x {0}. We give a finite presentation for the mapping class group of B fixing the arcs {a_1, ..., a_n} setwise and…
We introduce a class of countable groups by some abstract group-theoretic conditions. It includes linear groups with finite amenable radical and finitely generated residually finite groups with some non-vanishing $\ell^2$-Betti numbers that…
A group is SimpHAtic if it acts geometrically on a simply connected simplicially hereditarily aspherical (SimpHAtic) complex. We show that finitely presented normal subgroups of the SimpHAtic groups are either: finite, or of finite index,…
A recent conjecture of the author and Teng Fang states that there are only finitely many finite simple groups with no cubic graphical regular representation. In this paper, we make a crucial progress towards this conjecture by giving an…
Given any finitely presented group G we find a triangular algebra such that has two presentations, one with fundamental group G and another with trivial group. Thus proving that given a collection G1,...,Gn of finitely presented groups…
Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Define the length of a finite presentation of a group $G$ as the sum of lengths of all relators plus the number of generators. How large can be the $k$th Betti number $b_k(G)=$ rank $H_k(G)$ providing that $G$ has length $\leq N$ and…
Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…
The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…
The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…
Let W be an irreducible finitely generated Coxeter group. The geometric representation of W in GL(V) provides a discrete embedding in the orthogonal group of the Tits form (the associated bilinear form of the Coxeter group). If the Tits…
A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
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…