In this paper, we study conditions on algebras with multiplicative bases so that there is a Gröbner basis theory. We introduce right Gröbner bases for a class of modules. We give an elimination theory and intersection theory for right submodules of projective modules in path algebras. Solutions to h
Special biserial algebras and right Gröbner bases
✍ Scribed by Yang Han; De Han
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 119 KB
- Volume
- 262
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown that a finite-dimensional basic algebra over an algebraically closed field is representation-finite special biserial if and only if every module over it has a right Gröbner basis theory.
📜 SIMILAR VOLUMES
We show that the Buchberger algorithm for commutative polynomials over a field may be generalised to an algebraic structure which embeds such polymomials, the exterior polynomial algebra, and which is a natural domain for linear geometry. In particular, those finite sets of exterior polynomials whic
We give an account of the theory of Gröbner bases for Clifford and Grassmann algebras, both important in physical applications. We describe a characterization criterion tailored to these algebras which is significantly simpler than those given earlier or for more general non-commuting algebras. Our
In this paper, we study the structure of Specht modules over Hecke algebras using the Gröbner-Shirshov basis theory for the representations of associative algebras. The Gröbner-Shirshov basis theory enables us to construct Specht modules in terms of generators and relations. Given a Specht module S
We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g
We show how the complexity of counting relates to the well known phenomenon that computing Gröbner bases under a lexicographic order is generally harder than total degree orders. We give simple examples of polynomials for which it is very easy to compute their Gröbner basis using a total degree orde