Please use this identifier to cite or link to this item:
Title: El nombre de Frobenius
Author: Maristany Sala, Pau
Director/Tutor: Zarzuela, Santiago
Keywords: Nombres naturals
Treballs de fi de grau
Anàlisi diofàntica
Àlgebra commutativa
Natural numbers
Bachelor's thesis
Diophantine analysis
Commutative algebra
Issue Date: 27-Jun-2018
Abstract: [en] Let $a_{1},..., a_{n}$ be positive integers, find the largest natural number that is not representable as a non-negative combination of $a_{1},..., a_{n}$. This problem is called Frobenius Problem. The project consists on a exposition of some of the most important results about this problem. We will study it using numerical semigroups and Hilbert series. We will prove that Frobenius Problem is $\mathcal{NP}$-hard and also that there is no polynomial formula for the general case.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2018, Director: Santiago Zarzuela
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
memoria.pdfMemòria547.51 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons