Computing Border Bases without using a Term Ordering

@article{Kaspar2011ComputingBB,
  title={Computing Border Bases without using a Term Ordering},
  author={Stefan Kaspar},
  journal={CoRR},
  year={2011},
  volume={abs/1104.2724}
}
Border bases, a generalization of Gröbner bases, have actively been researched during recent years due to their applicability to industrial problems. In [6] Kehrein and 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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…