Related papers: Algorithmically complex residually finite groups
For a group G we consider the set of natural numbers n for which the nth cohomology functor of G commutes with filtered colimit systems of coefficient modules. We find that for the large class of hierarchically decomposable groups there is…
We prove that Abels' group over an arbitrary nondiscrete locally compact field has a quadratic Dehn function. As applications, we exhibit connected Lie groups and polycyclic groups whose asymptotic cones have uncountable abelian fundamental…
Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated…
Motivated by applications to equivariant neural networks and cryo-electron microscopy we consider the problem of recovering the generic orbit in a representation of a finite group from invariants of low degree. The main result proved here…
We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…
We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…
We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.
We construct the first explicit finite presentations for a family of K\"ahler groups with arbitrary finiteness properties, answering a question of Suciu.
We give the first example of a non-linear residually finite 1-related group: < a, t | a^{t^2}=a^2>.
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
In this paper we prove that free solvable groups have finite Krull dimension. In fact, this is true for much wider class of solvable groups, termed rigid groups. Along the way we study the algebraic structure of the limit solvable groups…
Using quantum representations of mapping class groups we prove that profinite completions of Burnside-type surface group quotients are not virtually prosolvable, in general. Further, we construct infinitely many finite simple characteristic…
In this paper we give a partial answer to a 1980 question of Lazslo Babai: "Which [finite] groups admit an oriented graph as a DRR?" That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite…
This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…
We prove that a finite complex reflection group has a generalized involution model, as defined by Bump and Ginzburg, if and only if each of its irreducible factors is either $G(r,p,n)$ with $\gcd(p,n)=1$; $G(r,p,2)$ with $r/p$ odd; or…
We determine the structure of the finite non-solvable groups of order divisible by $3$ all whose maximal subgroups of order divisible by $3$ are supersolvable. Precisely, we demonstrate that if $G$ is a finite non-solvable group satisfying…
Using previous results concerning the rank two and rank three cases, all connected simply connected Cartan schemes for which the real roots form a finite irreducible root system of arbitrary rank are determined. As a consequence one obtains…
We prove that with probability tending to 1, a 1-relator group with at least 3 generators and relator of length n is residually finite, virtually residually (finite p)-group for all sufficiently large p, and coherent. The proof uses both…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…