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
Minimal Primary Decomposition and Factorized Gröbner Bases
✍ Scribed by Hans-Gert Gräbe
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 194 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0938-1279
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We generalize the concept of a minimum lag description to multidimensional autoregressive discrete systems. We show that our deÿnition is equivalent to the property that the rows of the representation matrix form a minimal Gr obner basis. In the 1D case, the new deÿnition is strictly stronger than t
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
By means of combinatorics on finite distributive lattices, lexicographic quadratic Gröbner bases of certain kinds of subrings of an affine semigroup ring arising from a finite distributive lattice will be studied.