ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Journal of Symbolic Computation
Volume 33, Issue 1, January 2002, Pages 43-55
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (254 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1006/jsco.2001.0478    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science Ltd. All rights reserved.

Regular Article

Continuously Parameterized Symmetries and Buchberger’s Algorithm

Ralf Hemmecke1

Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria

Received 5 September 1996; 
accepted 13 June 2001. ;
Available online 27 February 2002.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Systems of polynomial equations often have symmetries. In solving such a system using Buchberger’s algorithm, the symmetries are neglected. Incorporating symmetries into the solution process enables us to solve larger problems than with Buchberger’s algorithm alone. This paper presents a method that shows how this can be achieved and also gives an algorithm that brings together continuously parameterized symmetries with Buchberger’s algorithm.


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.