Related papers: Coset enumeration for certain infinitely presented…

We consider ordered tuples in finite groups generating nilpotent subgroups. Given an integer $q$ we consider the poset of nilpotent subgroups of class less than $q$ and its corresponding coset poset. These posets give rise to a family of…

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

We describe the block structure of finitely generated subgroups of branch groups with the so-called subgroup induction property, including the first Grigorchuk group $\mathcal{G}$ and the torsion GGS groups.

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

We consider the topological full group of a substitution subshift induced by a substitution $a\to aca$, $b\to d$, $c\to b$, $d\to c$. This group is interesting since the Grigorchuk group naturally embeds into it. We show that the…

We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

We determine the finite groups whose real irreducible representations have different degrees.

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

We define precuspidal families in proper parabolic subgroups of a Weyl group and we show how to use them to index the irreducible representations of that Weyl group in terms of certain pairs of finite groups. Some additional material is…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…

In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.

We investigate two ways in which self-maps of an infinite set may be close to bijections; our investigation generates a $\mathbb{Z}$-valued index theory and a corresponding extension by $\mathbb{Z}$ for the quotient of the full symmetric…

We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.

We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…