Related papers: Extremely strong Shoda pairs with \texttt{GAP}

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

A strong Gelfand pair $(G, H)$ is a finite group $G$ and a subgroup $H$ where every irreducible character of $H$ induces to a multiplicity-free character of $G$. We determine the strong Gelfand pairs of the sporadic groups, their…

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

The aim of the article is to show that there are many finite extensions of arithmetic groups which are not residually finite. Suppose $G$ is a simple algebraic group over the rational numbers satisfying both strong approximation, and the…

In earlier work, Katz exhibited some very simple one parameter families of exponential sums which gave rigid local systems on the affine line in characteristic p whose geometric (and usually, arithmetic) monodromy groups were SL(2,q), and…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

In this paper we give an explicit description of primitive central idempotents of rational group algebras of finite abelian groups using long presentation, and determine their Wedderburn decompositions.

We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to…

In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…

We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…

This paper has two main parts. In the first part we develop an elementary coordinatization for any nilpotent group $G$ taking exponents in a binomial principal ideal domain (PID) $A$. In case that the additive group $A^+$ of $A$ is finitely…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

Let $G$ be a finite group and $\sigma=\{\sigma_{i}|i\in I\}$ be a partition of the set of all primes $\mathbb{P}$, that is, $\mathbb{P}=\bigcup_{i\in I}\sigma_{i}$ and $\sigma_{i}\cap \sigma_{j}=\emptyset$ for all $i\neq j$. A chief factor…

We investigate the computational complexity of various decision problems related to conjugacy in finite inverse semigroups. We describe polynomial-time algorithms for checking if two elements in such a semigroup are ~p conjugate and whether…

Let $\Delta$ be a finite set and $G$ be a subgroup of $\operatorname{Sym}(\Delta)$. An irredundant base for $G$ is a sequence of points of $\Delta$ yielding a strictly descending chain of pointwise stabilisers, terminating with the trivial…

A classical theorem due to Brauer and Witt implies that every simple component of the rational group algebra QG of a finite group G is Brauer equivalent to a cyclotomic algebra containing Q in its centre. The precise description of this…

A p-group is called powerful if every commutator is a product of pth powers when p is odd and a product of fourth powers when p=2. In the group algebra of a group G of p-power order over a finite field of characteristic p, the group of…