Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6861250 | Journal of Symbolic Computation | 2015 | 15 Pages |
Abstract
Certain weight-based orders on the free associative algebra R=kãx1,â¦,xtã can be specified by tÃâ arrays whose entries come from the subring of positive elements in a totally ordered field. If such an array satisfies certain additional conditions, it produces a partial order on R which is an admissible order on the quotient R/I, where the ideal I is a homogeneous binomial ideal called the weight ideal associated to the array. The structure of the weight ideal is determined entirely by the array. This article discusses the structure of the weight ideals associated to two distinct types of arrays which define admissible orders on the associated quotient algebra.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jeremiah W. Johnson,