Solving Thousand Digit Frobenius Problems Using Grobner Bases
Combinatorics
2009-03-03 v2
Abstract
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.
Cite
@article{arxiv.math/0702040,
title = {Solving Thousand Digit Frobenius Problems Using Grobner Bases},
author = {Bjarke Hammersholt Roune},
journal= {arXiv preprint arXiv:math/0702040},
year = {2009}
}
Comments
7 pages. See http://www.broune.com/ for associated benchmarks and software. Version 2 includes some minor corrections