Quivers and path algebras
The "Quivers and Path Algebras" team has as a goal to develop a GAP package(s) for carrying out computations for finite dimensional quotients of path algebras over the fields that are available in GAP. The package we aim to develop for GAP is called QPA for Quivers and Path Algebras. QPA is currently a deposited GAP-package.
A bit of history
The system design of QPA was initiated by Edward L. Green, Lenwood S. Heath, and Craig A. Struble. It was continued and completed by Randall Cone and Edward Green. In addition, the following persons have given valuable contributions: Nicholas Allen (orderings, tensor products, user documentation), Gerard Brunick (quivers, path algebras, Drinfeld double), Timothy Terriberry (orderings) and George Yuhasz (user documentation, matrix representations of path algebras, tensor products).
What is it?
The current version of the QPA package have the basic features for creating a program that can do a variety of computations for finite dimensional qoutients of path algebras. In particular, it has data structures for quivers, quotients of path algebras, representations of quivers with relations and complexes of modules. One of the major aims is to be able to contruct projective resolutions of finitely generated modules over finite dimensional quotients of path algebras. One can construct minimal projective resolutions with algorithms using linear algebra, which might not be the most efficient. The not necessarily minimal projective resolution constructed by Green-Solberg-Zacharia in "Minimal projective resolutions" has been implemented, but not much infrastructure has been buildt around it yet. An other goal is to have a test for finite representation type. This work has started, but there is a long way left. Part of this work is to implement/port the functionality and data structures that was available in CREP.
See the WhatYouCanDoList for more precise information on what you can do in QPA. If there is something you don't find, please tell us and we might already have thought about it or we can put it high on the todo list.
In addition to the above, we have a long list of computations we want to implement in our package, see the
If you have suggestions of computations/algorithms that you want to see implemented and it is not on the list, please contact us.
What can it do?
Here is what you can do in the latest version (or at least hopefully modulo bugs) of QPA,
Since the release of GAP version 4.7.8, the package QPA is distributed with GAP, so if you download this version or any later version QPA will be installed at the same time as GAP is installed. For a mac, follow the instructions for installing GAP on this web page or follow the instructions given in this video. For a Windows machine, follow the instructions for installing GAP given in this video
After having successfully started GAP, give the command
which loads QPA and you can start using QPA.
For making the documentation for QPA give the command
To avoid giving the command LoadPackage("qpa"); each time you want to run QPA, you can follow the instructions given here.
For GAP version 4.7.7 or older, or you want a newer version of QPA than the one that is distributed with GAP, follow the following instructions:
ContributingThis is an open source project, so you are invited to contribute. Go to the web page
For downloading the latest version: Assuming that GAP is installed on your computer, follow the following steps:
A new version of QPA
A completely rewritten version of QPA is currently developed in parallell at QPA2 on GitHub. This will hopefully at a not so distant furture replace version 1 of QPA, containing the same functionality and more.
How to cite QPA?
If you publish a result which was partially obtained with the usage of QPA, please cite it in the following form:
The QPA-team, QPA - Quivers, path algebras and representations - a GAP package, Version 1.25; 2016 (https://folk.ntnu.no/oyvinso/QPA/)
The current group of people contributing to this project is: