Translator Disclaimer
VOL. 68 | 2016 Algorithms for primary decomposition in Singular
Hans Schönemann

Editor(s) Raimundo Nonato Araújo dos Santos, Victor Hugo Jorge Pérez, Takashi Nishimura, Osamu Saeki

Abstract

Gröbner bases are the main computational tool available for algebraic geometry. Building on top of Gröbner bases algorithms for ideal theoretical operations (intersection, quotient, saturation, free resolution,...) will be presented. Combining these algorithms with (multivariate) factorization leads to several algorithms for primary decomposition of ideals.

Information

Published: 1 January 2016
First available in Project Euclid: 4 October 2018

zbMATH: 1369.13037
MathSciNet: MR3585781

Digital Object Identifier: 10.2969/aspm/06810171

Subjects:
Primary: 13P10, 14Q99, 68W30

Rights: Copyright © 2016 Mathematical Society of Japan

PROCEEDINGS ARTICLE
20 PAGES


SHARE
Back to Top