• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Submit Paper
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Advisory Editorial Board
    • Editorial Office
    • Indexing Databases
    • Related Links
    • FAQ
    • Peer Review Process
    • News and Announcements
  • Guide for Authors
  • Contact Us
 
  • Login
  • Register
Home Article Info
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • Export to
    RIS
Bulletin of the Iranian Mathematical Society
Articles in Press
Current Issue
Journal Archive
Volume Volume 39 (2013)
Volume Volume 38 (2012)
Volume Volume 37 (2011)
Volume Volume 36 (2010)
Volume Volume 35 (2009)
Volume Volume 34 (2008)
Volume Volume 33 (2007)
Volume Volume 32 (2006)
Volume Volume 31 (2005)
Volume Volume 30 (2004)
Volume Volume 29 (2003)
Volume Volume 28 (2002)
Volume Volume 27 (2001)

Applying Buchberger's criteria on Montes's DisPGB algorithm

Article 49, Volume 38, Number 3, September 2012, Page 715-724  XML PDF (285 K)
Document Type: Research Paper
Authors
1Amir Hashemi ; 2Mahdi Dehghani Darmian; 2Benyamin M.-Alizadeh
1Isfahan university of technology
2Isfahan University of Technology
Abstract
The concept of comprehensive Grobner bases was introduced by
Weispfenning. Montes has proposed an efficient algorithm for computing
these bases. But he has not explicitly used Buchberger's
criteria in his algorithm. In this paper we prove that we can
apply these criteria on Montes algorithm. We propose a modified
version of Montes algorithm and evaluate its performance via some
examples.
Keywords
Grobner bases; Comprehensive Grobner bases; DisPGB algorithm
Main Subjects
13-XX Commutative algebra
Statistics
Article View: 32
PDF Download: 29
Home | Glossary | Aims and Scope | Sitemap
Top Top

© 2013 All Rights Reserved. Powered by SINAWEB.