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
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
Given a presentation for a rack , we define a process which systematically enumerates the elements o...
The aim of this work is to contribute to the development of a formal framework for the study of the ...
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...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
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 ...
AbstractAlgorithms can be used to prove and to discover new theorems. This paper shows how algorithm...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
Given a presentation for a rack , we define a process which systematically enumerates the elements o...
The aim of this work is to contribute to the development of a formal framework for the study of the ...
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...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
AbstractWe introduce a generalization of the Todd-Coxeter procedure for the enumeration of cosets. T...
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 ...
AbstractAlgorithms can be used to prove and to discover new theorems. This paper shows how algorithm...
AbstractThis paper considers the problem of enumeration under group actions in the framework of mult...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
Many research in coding theory is focussed on linear error-correcting codes. Since these codes are s...
Given a presentation for a rack , we define a process which systematically enumerates the elements o...
The aim of this work is to contribute to the development of a formal framework for the study of the ...