El nombre de Frobenius

Vista senzilla d'ítem
dc.contributor.advisorZarzuela, Santiago
dc.contributor.authorMaristany Sala, Pau
dc.date.accessioned2019-01-17T08:29:11Z
dc.date.available2019-01-17T08:29:11Z
dc.date.issued2018-06-27
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2018, Director: Santiago Zarzuelaca
dc.description.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.ca
dc.format.extent61 p.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/2445/127363
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Pau Maristany Sala, 2018
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques
dc.subject.classificationNombres naturalsca
dc.subject.classificationTreballs de fi de grau
dc.subject.classificationAnàlisi diofànticaca
dc.subject.classificationSemigrupsca
dc.subject.classificationÀlgebra commutativaca
dc.subject.otherNatural numbersen
dc.subject.otherBachelor's theses
dc.subject.otherDiophantine analysisen
dc.subject.otherSemigroupsen
dc.subject.otherCommutative algebraen
dc.titleEl nombre de Frobeniusca
dc.typeinfo:eu-repo/semantics/bachelorThesisca

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Miniatura
Nom:
memoria.pdf
Mida:
547.51 KB
Format:
Adobe Portable Document Format
Descripció:
Memòria
Descarregar

Col·leccions

Treballs Finals de Grau (TFG) - Matemàtiques