Related papers: Proving finitely presented groups are large by com…

Let $\Gamma$ be a group and $r_n(\Gamma)$ the number of its $n$-dimensional irreducible complex representations. We define and study the associated representation zeta function $\calz_\Gamma(s) = \suml^\infty_{n=1} r_n(\Gamma)n^{-s}$. When…

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…

We develop a theory of generalized presentations of groups. We give generalized presentations of the symmetric group $\Sigma(X)$ for an arbitrary set $X$ and of the automorphism group of the free group of countable rank, $Aut(F_{\omega})$.

We show that the kernel of the monodromy representation for hypersurfaces of degree d and dimension n is large for d at least three with the exception of the cases (d,n) = (3,0) and (3,1). For these the kernel is finite. By "large" we mean…

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…

We consider dense 2-generator multiplicative subgroups in $\mathbb C$ and show that for each point $z\in \mathbb C$ the set of limit values for the arguments of the powers of each generator at the point $z$ is either finite or is…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

This paper surveys basic properties of finite presentation in groups, Lie algebras and rings. It includes some new results and also new, more elementary proofs, of some results that are already in the literature. In particular, we discuss…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…

Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

Full residual finiteness growth of a finitely generated group $G$ measures how efficiently word metric $n$-balls of $G$ inject into finite quotients of $G$. We initiate a study of this growth over the class of nilpotent groups. When the…

In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.

We construct a random model for an $n$-fold branched cover of a finite acceptable $2$-complex $X$. This includes presentation $2$-complexes for finitely presented groups satisfying some mild conditions. For any $\lambda >0$, we show that as…

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…