AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for computational methods to be developed which prove that a given finitely presented group is not n-linear over a field k assuming some mild conditions. We also present an algorithm which determines whether or not a finitely presented group G is trivial given that an oracle has told us that G is n-linear over an algebraically closed field k
We develop new techniques to classify basic algebras of blocks of finite groups over algebraically c...
This graduate-level text provides a thorough grounding in the representation theory of finite groups...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for comput...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractLet S⊂GL(V) be a given set of generators for a group G, where V is a finite-dimensional vect...
AbstractTits has shown that a finitely generated matrix group either contains a nonabelian free grou...
Let a finite presentation be given for an associative, in general non-commutative algebra E, with id...
In this thesis, we develop practical algorithms for irreducibility and primitivity testing of finite...
AbstractWe use algorithms developed recently for the study of linear groups to investigate a sequenc...
AbstractLet G be a finite group, K be a field and G→GL(V) be a faithful representation where V is a ...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
k is a field, X1,…, Xn are indeterminates over k and f1,…,fm∈k[X1,…,Xn]. This note presents a simple...
We develop new techniques to classify basic algebras of blocks of finite groups over algebraically c...
This graduate-level text provides a thorough grounding in the representation theory of finite groups...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
AbstractWe apply the machinery of Gröbner bases to finitely presented groups. This allows for comput...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractLet S⊂GL(V) be a given set of generators for a group G, where V is a finite-dimensional vect...
AbstractTits has shown that a finitely generated matrix group either contains a nonabelian free grou...
Let a finite presentation be given for an associative, in general non-commutative algebra E, with id...
In this thesis, we develop practical algorithms for irreducibility and primitivity testing of finite...
AbstractWe use algorithms developed recently for the study of linear groups to investigate a sequenc...
AbstractLet G be a finite group, K be a field and G→GL(V) be a faithful representation where V is a ...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
k is a field, X1,…, Xn are indeterminates over k and f1,…,fm∈k[X1,…,Xn]. This note presents a simple...
We develop new techniques to classify basic algebras of blocks of finite groups over algebraically c...
This graduate-level text provides a thorough grounding in the representation theory of finite groups...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
DOI
Add to ORKG