Related papers: Algorithms determining finite simple images of fin…

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

We describe an algorithm which determines whether or not a group which is hyperbolic relative to abelian groups admits a nontrivial splitting over a finite group.

Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…

We study the problem of determining if the braid group representations obtained from quantum groups of types $E, F$ and $G$ at roots of unity have infinite image or not. In particular we show that when the fusion categories associated with…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

We classify, up to isomorphism, all gradings by an arbitrary abelian group on simple finitary Lie algebras of linear transformations (special linear, orthogonal and symplectic) on infinite-dimensional vector spaces over an algebraically…

We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we…

Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…

It was shown by Lubotzky in 2014 that automorphism invariant subsets of finite simple groups which contain identity are always word images. In this article, we study word maps on finite nilpotent groups and show that for arbitrary finite…

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 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…

Finite group theorists have established many formulas that express interesting properties of a finite group in terms of sums of characters of the group. An obstacle to applying these formulas is lack of control over the dimensions of…

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

We show that certain representations over fields with positive characteristic of groups having CAT(0) fixed point property ${\rm F}\mathcal{B}_{\widetilde{A}_n}$ have finite image. In particular, we obtain rigidity results for…

We consider the computational problem of determining the unit group of a finite ring, by which we mean the computation of a finite presentation together with an algorithm to express units as words in the generators. We show that the problem…

Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many…