Grobner Bases

DSpace Repository

Show simple item record

dc.contributor.author Fabiana Cullhaj; Department of Mathematic, University of "Aleksander Moisiu" Durres
dc.contributor.author Edmond Pisha; Department of Mathematic, Tirana University
dc.date 2013-06-17 09:25:59
dc.date.accessioned 2013-07-15T11:51:57Z
dc.date.accessioned 2015-11-23T16:01:40Z
dc.date.available 2013-07-15T11:51:57Z
dc.date.available 2015-11-23T16:01:40Z
dc.date.issued 2013-07-15
dc.identifier http://ecs.epoka.edu.al/index.php/iscim/iscim2011/paper/view/702
dc.identifier.uri http://dspace.epoka.edu.al/handle/1/713
dc.description.abstract In this paper, we will give a leisurely introduction to the theory of Grobner bases.First we will see how to determine whether a polynomial f is contained in an idealand how an answer to this problem leads to a method to determine whether two ideals are equal. We will use Euclidian Algorithem for solving this problems. After that will be introduced what we mean by the leading term of a polynomial in nvariables. So we will explain Grobner bases notion and will present the algorithem due to Bruno Buchberger wich transform the abstract notion of a Grobner basis in a fondamental tool in computational algebra. And in the end we will give some applications of Grobner bases.
dc.format application/pdf
dc.language en
dc.publisher International Symposium on Computing in Informatics and Mathematics
dc.source International Symposium on Computing in Informatics and Mathematics; 1st International Symposium on Computing in Informatics and Mathematics
dc.subject Variety; algorithem; term order; Grobner bases; reduced; S-polynomial
dc.title Grobner Bases
dc.type Peer-reviewed Paper


Files in this item

Icon
Name: 702-2361-1-PB.pdf
Size: 13.62Mb
Format: PDF
View/Open

This item appears in the following Collection(s)

  • ISCIM 2011
    1st International Symposium on Computing in Informatics and Mathematics

Show simple item record

Search DSpace


Browse

My Account