Arithmetical Graphs, Riemann-Roch Structure for Lattices, and the Frobenius Number Problem
If R is a list of positive integers with greatest common denominator equal to 1, calculating the Frobenius number of R is in general NP-hard. Dino Lorenzini defines the arithmetical graph, which naturally arises in arithmetic geometry, and a notion of genus, the g-number, that in specific cases coin...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2014
|
| Subjects: | |
| Online Access: | http://scholarship.claremont.edu/hmc_theses/57 http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1062&context=hmc_theses |