A computation method for ACGB-V

Katsusuke Nabeshima

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

Abstract

In this paper we describe an algorithm for ACGB-V (Alternative Comprehensive Groebner Basis on Varieties). Discrete comprehensive Groebner bases were proposed by Sato, Suzuki and Nabeshima. Discrete comprehensive Groebner bases are a special type of ACGB-V. In this paper we extend the method of discrete comprehensive Groebner basesto the general method of ACGB-V which uses Weispfenning's theory of Grobner bases in polynomial rings over commutative von Neumann regualr rings.
Original languageEnglish
Title of host publicationAlgorithm Algebra and Logic (A3L) 2005
Editors Dolzmann, A., Seidl, S., and Sturm, T.
PublisherBOD Norderstedt
Pages173-180
Number of pages8
ISBN (Print)3-8334-2669-1
Publication statusPublished - Apr 2005

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

Cite this