AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a finitely presented algebra on a finitely presented module. In this note we are going to present techniques to obtain algebra or module presentations from certain abstract situations, to facilitate analysis using the VectorEnumerator algorithm. Finally, we apply these techniques to modules for a certain Iwahori–Hecke algebra
AbstractWe describe a new extension of the Todd–Coxeter algorithm adapted to computing left Kan exte...
AbstractWe present a new and simple algorithm for completion of unimodular vectors with entries in a...
We present polynomial time algorithms for some fundamental tasks from representation theory of finit...
AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a ...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
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...
Let a finite presentation be given for an associative, in general non-commutative algebra E, with id...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractWe compute the Φe-modular decomposition matrices for the generic Iwahori–Hecke algebras of t...
In this paper, we present some basic algorithms for manipulation of finitely generated modules over ...
summary:We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\La...
summary:We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\La...
In this paper we determine the representation type of some algebras of infinite matrices continuousl...
Motivated by topological data analysis, we study in this article certain notions of “tameness” for m...
AbstractWe describe a new extension of the Todd–Coxeter algorithm adapted to computing left Kan exte...
AbstractWe present a new and simple algorithm for completion of unimodular vectors with entries in a...
We present polynomial time algorithms for some fundamental tasks from representation theory of finit...
AbstractThe VectorEnumerator algorithm is a tool to construct explicit matrices for the action of a ...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
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...
Let a finite presentation be given for an associative, in general non-commutative algebra E, with id...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
AbstractWe compute the Φe-modular decomposition matrices for the generic Iwahori–Hecke algebras of t...
In this paper, we present some basic algorithms for manipulation of finitely generated modules over ...
summary:We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\La...
summary:We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\La...
In this paper we determine the representation type of some algebras of infinite matrices continuousl...
Motivated by topological data analysis, we study in this article certain notions of “tameness” for m...
AbstractWe describe a new extension of the Todd–Coxeter algorithm adapted to computing left Kan exte...
AbstractWe present a new and simple algorithm for completion of unimodular vectors with entries in a...
We present polynomial time algorithms for some fundamental tasks from representation theory of finit...