Related papers: Computing the Zariski closure of a finitely genera…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…
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…
We classify Galois objects for the dual of a group algebra of a finite group over an arbitrary field.
We present a generalization of the well known Next-Closure algorithm working on semilattices. We prove the correctness of the algorithm and apply it on the computation of the intents of a formal context.
In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…
In this paper we establish decomposition theorems for derivations of group rings. We provide a topological technique for studying derivations of a group ring $A[G]$ in case $G$ has finite conjugacy classes. As a result, we describe all…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
Let $p$ be a prime, $k$ an algebraic closure of $\mathbb{F}_p$ and $\Gamma$ the Galois group ${\rm Gal}(k/\mathbb{F}_p)$. Let $\mathcal{C}$ be a finite category and $\mathcal{O}_{\mathcal{C}}$ the $p$-orbit category of $\mathcal{C}$ defined…
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…
This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…
We compute the class group of a full rank upper cluster algebra in terms of its exchange polynomials. As a corollary, we recover a theorem by Cao, Keller, and Qin from 2023 characterizing the UFDs among these algebras. Furthermore, under…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
We provide an algorithmic description of a family of graded decomposition numbers for rational Cherednik algebras.
It is known that the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$ has a finite generating set. In this paper, we give a finite presentation of the level $2$ principal congruence subgroup of $GL(n;\mathbb{Z})$.
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
A connected algebraic group in characteristic 0 is uniquely determined by its Lie algebra. In this paper an algorithm is given for constructing an algebraic group in characteristic 0, given its Lie algebra. Using this an algorithm is…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
For a finite subgroup $G$ of the special unitary group $SU_2$, we study the centralizer algebra $Z_k(G) = End_G(V^{\otimes k})$ of $G$ acting on the $k$-fold tensor product of its defining representation $V= \mathbb{C}^2$. These subgroups…
We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…