Repositorio de producción científica de la Universidad de Sevilla

Bases de Gröbner: eliminación y programación lineal entera

Opened Access Bases de Gröbner: eliminación y programación lineal entera
Estadísticas
Icon
Exportar a
Autor: González Parra, Alba
Director: Castro Jiménez, Francisco Jesús
Departamento: Universidad de Sevilla. Departamento de álgebra
Fecha: 2015-06
Tipo de documento: Trabajo Fin de Grado
Titulación: Universidad de Sevilla. Grado en Matemáticas
Resumen: Gröbner basis is a basic concept in Computational Algebra; it was introduced by the Austrian mathematician Bruno Buchberger in 1965. A Gröbner basis of an ideal in a polinomial ring with coefficients over a field is a special generator set of the ideal. These bases have a very useful properties and applications. In this project we deal with the theory of Gr¨obner bases, starting with the definition of the concept, studying their main properties and explaining Buchberger’s algorithm for their computation. Then we give some applications The main objective of Elimination theory is the resolution of systems of polynomials equations. We use the Elimination theorem and the Extension theorem repeatedly, so at each step we only have to solve equations that depend on a finite subset of the original variables. The simplest case is when, at each step, we only need to solve equations depending on one single variable, but unfortunately this is not always posible. We also include here a geometri...
[Ver más]
Tamaño: 607.4Kb
Formato: PDF

URI: http://hdl.handle.net/11441/40802

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones