Motivated by the desire for better isomorphism tests for finite groups, we present a
polynomial-time algorithm for deciding isomorphism within a class of p-groups that is well …

We consider two basic algorithmic problems concerning tuples of (skew-) symmetric
matrices. The first problem asks us to decide, given two tuples of (skew-) symmetric matrices …

In the 1970s, Lovász built a bridge between graphs and alternating matrix spaces, in the
context of perfect matchings Proceedings of FCT, 1979, pp. 565--574. A similar connection …

We present a new algorithm to decide isomorphism between finite graded algebras. For a
broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the …

Let $\mathscr {C} $ be a classical group defined over a finite field. We present
comprehensive theoretical solutions to the following closely related problems: 1) List a …

Let $ G $ be a classical group defined over a finite field. We consider the following
fundamental problems concerning conjugacy in $ G $: 1. List a representative for each …

The linear associator is a classic associative memory model. However, due to its low
performance, it is pertinent to note that very few linear associator applications have been …

In the 1970's, Lov\'asz built a bridge between graphs and alternating matrix spaces, in the
context of perfect matchings (FCT 1979). A similar connection between bipartite graphs and …

Solving matrix inversion is very useful in many areas of science (eg, in physics and
engineering, such as chemical processes, robotics, electronic circuits, engineered materials …