Solving Thousand Digit Frobenius Problems Using Grobner Bases

Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7 A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irre...

Full description

Saved in:
Bibliographic Details
Main Author Roune, Bjarke Hammersholt
Format Journal Article
LanguageEnglish
Published 02.02.2007
Subjects
Online AccessGet full text
DOI10.48550/arxiv.math/0702040

Cover

Abstract Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7 A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible decompositions and Hilbert functions are also presented.
AbstractList Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7 A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible decompositions and Hilbert functions are also presented.
Author Roune, Bjarke Hammersholt
Author_xml – sequence: 1
  givenname: Bjarke Hammersholt
  surname: Roune
  fullname: Roune, Bjarke Hammersholt
BackLink https://doi.org/10.48550/arXiv.math/0702040$$DView paper in arXiv
https://doi.org/10.1016/j.jsc.2008.08.002$$DView published paper (Access to full text may be restricted)
BookMark eNrjYmDJy89LZWCQNjTQM7EwNTXQTyyqyCzTy00sydA3MDcwMjAx4GSwDc7PKcvMS1cIycgvLU7MS1FwyUzPLFFwK8pPSs3LLC1WCACyclJzixVCi0Hq3IHcvNQiBafE4tRiHgbWtMSc4lReKM3NoOjmGuLsoQu2Kr6gKDM3sagyHmRlPNRKY2LUAABMcDro
ContentType Journal Article
DBID AKZ
GOX
DOI 10.48550/arxiv.math/0702040
DatabaseName arXiv Mathematics
arXiv.org
DatabaseTitleList
Database_xml – sequence: 1
  dbid: GOX
  name: arXiv.org
  url: http://arxiv.org/find
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID math_0702040
GroupedDBID AKZ
GOX
ID FETCH-arxiv_primary_math_07020403
IEDL.DBID GOX
IngestDate Wed Jul 23 02:00:38 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-arxiv_primary_math_07020403
OpenAccessLink https://arxiv.org/abs/math/0702040
ParticipantIDs arxiv_primary_math_0702040
PublicationCentury 2000
PublicationDate 2007-02-02
PublicationDateYYYYMMDD 2007-02-02
PublicationDate_xml – month: 02
  year: 2007
  text: 2007-02-02
  day: 02
PublicationDecade 2000
PublicationYear 2007
Score 2.751173
SecondaryResourceType preprint
Snippet Journal of Symbolic Computation, Volume 43, Issue 1, January 2008, Pages 1-7 A Grobner basis-based algorithm for solving the Frobenius Instance Problem is...
SourceID arxiv
SourceType Open Access Repository
SubjectTerms Mathematics - Combinatorics
Title Solving Thousand Digit Frobenius Problems Using Grobner Bases
URI https://arxiv.org/abs/math/0702040
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwY2BQMU0CdhoskpN1k1KSU3VNzNOMdBNTzIx0U9OMjVNMkszS0oxAG5x9_cw8Qk28IkwjmBiUYHthEosqMssg5wMnFesDG20Z-sBEaQRMaswMzMCmAmg7r38E5Pgg8GFcUB3IKoHtTLAgUkXhJsjAD23hKThCokSIgSk1T4TBNjg_B9R1VwjJyAetg0lRcMlMzyxRcAPtxsnLLC1WCIDc7FKsAJ7EV3AHcvNSixScgLVMsSiDoptriLOHLtjC-ALICRHxINfEQ11jLMbAAuzJp0owKJglGxinGqRZmKVYmJkYJhlbJIKaW0lJqUA6LcXSVJJBCrc5UvgkpRm4IIOORkAkw8BSUlSaKgusLUuS5MABBgD64XIl
linkProvider Cornell University
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Solving+Thousand+Digit+Frobenius+Problems+Using+Grobner+Bases&rft.au=Roune%2C+Bjarke+Hammersholt&rft.date=2007-02-02&rft_id=info:doi/10.48550%2Farxiv.math%2F0702040&rft.externalDocID=math_0702040