OpenstarTs >
EUT-Periodici >
Rendiconti dell’Istituto di matematica dell’Università di Trieste: an International Journal of Mathematics >
Rendiconti dell' Istituto di matematica dell‘ Università di Trieste: an International Journal of Mathematics vol.39 (2007) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10077/4114

Title: An Algorithm for Computing Primitive Relations
Authors: Scaramuzza, Anna
Issue Date: 2007
Publisher: EUT Edizioni Università di Trieste
Citation: Anna Scaramuzza, "An Algorithm for Computing Primitive Relations”, in: Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics, 39 (2007), pp. 275–299.
Series/Report no.: Rendiconti dell’Istituto di Matematica dell’Università di Trieste. An International Journal of Mathematics
39 (2007)
Abstract: Let X be a smooth complete toric variety of dimension n. It is described by its fan $\Sigma_X$. To study X from the point of view of Mori theory it is very convenient to present $\Sigma_X$ enumerating its primitive relations and collections (see [2], [3]). In this paper we describe the algorithm that computes the primitive relation associated to a primitive collection.
URI: http://hdl.handle.net/10077/4114
ISSN: 0049-4704
Appears in Collections:Rendiconti dell' Istituto di matematica dell‘ Università di Trieste: an International Journal of Mathematics vol.39 (2007)

Files in This Item:

File Description SizeFormat
ScamuzzaRendMat39.pdf199.66 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.