AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightly extending the algorithm, we obtain a simpler description of the calculation which it performs. We also describe an application of this method to a problem in computational representation theory, which itself has applications in algebraic topology and possibly other areas
Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it a...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a ...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
Let a finite presentation be given for an associative, in general non-commutative algebra E, with id...
In this thesis a method for the enumeration of generators of modules over Euclidean domains is prese...
AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a ...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it a...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a ...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
Let a finite presentation be given for an associative, in general non-commutative algebra E, with id...
In this thesis a method for the enumeration of generators of modules over Euclidean domains is prese...
AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a ...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it a...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...