A new type of canonical Gröbner bases in polynomial rings over Von Neumann regular rings

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A new type of canonical Gröbner bases in polynomial rings over Von Neumann regular rings

Full text

Pdf (215 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1998 international symposium on Symbolic and algebraic computation table of contents

Rostock, Germany

Pages: 317 - 321

Year of Publication: 1998

ISBN:1-58113-002-3

Author

Yosuke Sato

Department of Computer Science, Ritsumeikan University, 1-1-1 Nojihigashi, Kusatsu, Shiga, 527-8577, Japan

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 15, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/281508.281658 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BUCHBERGER, B. Ein Algorithms zum Auf-finden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. PhD thesis, Universit/it Innsbruck, 1965.
	2	BUCHBERGER, B. GrSbner bases: An algorithmic method in polynomial ideal theory. In Recent Trends in Multidimensional System Theory, N. K. Bose, Ed. Reidel Publ. Comp., 1985, ch. 6.
	3	H. Michael Möller, On the construction of Gro¨bner bases using syzygies, Journal of Symbolic Computation, v.6 n.2-3, p.345-359, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80052-X]
	4	SAKAI, K., AND SATO, Y. Boolean grSbner bases. In LA-Symposium in winter, RIMS, Kyoto Univ. (1988), pp. 29-40.
	5	SAKAI, K., SATO, Y., AND MENJU, S. Boolean grSbner bases(revised). Technical Report 613, ICOT, 1990.
	6	SARACINO, D., AND WEISPFENNING, V. On algebraic curves over commutative regular rings. In Model Theory and Algebra, a memorial tribute to A.Robinson, @ringer LNM (1975), vol. 498, pp. 307-387.
	7	SATO, Y. Set constraint solver, a free software developed as a Research Funding Program of AITEC, Research Institute For Advanced Information Technology, ftp://ftp.icot.or.jp/ifs/contract-research/95/DHT- 13/HT-13.tgz, 1995.
	8	SATO, Y. Application of groebner basis in constraint of non-numerical domains. In The 2nd IMA CS Conference on Applications of Computer Algebra (1996).
	9	SATO, Y. Nonstandard canonical forms of set constraints. In Second International Conference on Principles and Practice of Constraint Programming, Set Constraints Workshop (1996).
	10	SATO, Y. Set constraint solver - groebner bases for nonnumerical domains-. In ISSAC'97 Poster Abstracts (1997), pp. 13-14.
	11	Volker Weispfenning, Gröbner bases for polynomial ideals over commutative regular rings, Proceedings of the European Conference on Computer Algebra, p.336-347, June 02-05, 1987

CITED BY 4

	Yosuke Sato , Akira Suzuki, Discrete comprehensive Gröbner bases, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.292-296, July 2001, London, Ontario, Canada
	Akira Suzuki , Yosuke Sato, An alternative approach to comprehensive Gröbner bases, Journal of Symbolic Computation, v.36 n.3-4, p.649-667, September 2003
	Akira Suzuki , Yosuke Sato, An alternative approach to comprehensive Gröbner bases, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.255-261, July 07-10, 2002, Lille, France
	Yosuke Sato, Parallel computation of boolean gröbner bases, ACM SIGSAM Bulletin, v.34 n.1, p.27-28, March 2000