This paper generalizes the Buchberger-M\"oller algorithm to zero-dimensional schemes in both affine and projective spaces. We also introduce a new, general way of viewing the problems which can be solved by the algorithm: an approach which looks to be readily applicable in several areas. Implementation issues are also addressed, especially for computations over~$\bbb Q$ where a trace-lifting paradigm is employed. We give a complexity analysis of the new algorithm for fat points in affine space over~$\bbb Q$. Tables of timings show the new algorithm to be efficient in practice.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | Computing zero-dimensional schemes |
Autori: | |
Data di pubblicazione: | 2005 |
Rivista: | |
Abstract: | This paper generalizes the Buchberger-M\"oller algorithm to zero-dimensional schemes in both affine and projective spaces. We also introduce a new, general way of viewing the problems which can be solved by the algorithm: an approach which looks to be readily applicable in several areas. Implementation issues are also addressed, especially for computations over~$\bbb Q$ where a trace-lifting paradigm is employed. We give a complexity analysis of the new algorithm for fat points in affine space over~$\bbb Q$. Tables of timings show the new algorithm to be efficient in practice. |
Handle: | http://hdl.handle.net/11567/267480 |
Appare nelle tipologie: | 01.01 - Articolo su rivista |