On vector enumeration

DOI10.1016/0024-3795(93)90245-JzbMath0827.20021MaRDI QIDQ1311325

V. Pereyra

Publication date: 5 December 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

computational representation theorylinear Todd-Coxeter algorithm

Mathematics Subject Classification ID

Related Items (6)

A note on applications of the `Vector Enumerator' algorithm. ⋮ The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results ⋮ Termination for a class of algorithms for constructing algebras given by generators and relations ⋮ Extending polar spaces of rank at least 3 ⋮ The freeness conjecture for Hecke algebras of complex reflection groups, and the case of the Hessian group \(G_{26}\). ⋮ Computing over K-modules

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
• Constructing matrix representations of finitely presented groups
• Algebraic groups and modular Lie algebras

This page was built for publication: On vector enumeration