Related papers: Algorithmic decidability of Engel's property for a…

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…

A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…

Let $A$ be a finite-dimensional (Artinian) Gorenstein algebra, and let $\operatorname{Aut}(A)^{\circ}$ denote the connected component of the identity in the automorphism group of $A$. We introduce a new subclass of Gorenstein algebras and…

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…

The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…

We show that for the family of complex reflection groups $G=G(m,p,2)$ appearing in the Shephard--Todd classification, the endomorphism ring of the reduced hyperplane arrangement $A(G)$ is a non-commutative resolution for the coordinate ring…

A fundamental question in logic and verification is the following: for which unary predicates $P_1, \ldots, P_k$ is the monadic second-order theory of $\langle \mathbb{N}; <, P_1, \ldots, P_k \rangle$ decidable? Equivalently, for which…

For a finite group $G$, let $\omega(G)$ be the set of element orders of $G$ and let $h(G)$ be the number of pairwise nonisomorphic finite groups $H$ with $\omega(H)=\omega(G)$. We say that the recognition problem is solved for $G$ if the…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

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 prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…

Let $G$ be a simple algebraic group of exceptional type over an algebraically closed field of characteristic $p \geqslant 0$ which is not algebraic over a finite field. Let $\mathcal{C}_1, \ldots, \mathcal{C}_t$ be non-central conjugacy…

Let $p$ be a prime and $a$ a quadratic non-residue $\bmod p$. Then the set of integral solutions of the diophantine equation $x_0^2 - ax_1^2 -px_2^2 + apx_3^2=1$ form a cocompact discrete subgroup $\Gamma_{p,a}\subset SL(2,\mathbb{R})$ and…