Computing Border Bases without using a Term Ordering

Details Computing Border Bases without using a Term Ordering Computing Border Bases without using a Term Ordering

2011-04-14

arxiv.org/abs/1104.2724v1

Mathematics

Commutative Algebra

12 pages

Scientific paper

Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm which allows the computation of border bases that relate to a degree compatible term ordering. In this paper we extend the original Border Basis Algorithm in such a way that also border bases that do not relate to any term ordering can be computed by it.

Affiliated with

Also associated with

No associations

Rating

Computing Border Bases without using a Term Ordering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Border Bases without using a Term Ordering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Border Bases without using a Term Ordering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-166488