Generalised Frobenius numbers : geometry of upper bounds, Frobenius graphs and exact formulas for arithmetic sequences
Given a positive integer vector ${\ve a}=(a_{1},a_{2}\dots,a_k)^t$ with \bea 1< a_{1}<\cdots<a_{k}\, \quad \text{and}\quad \gcd(a_{1},\ldots,a_{k})=1 \,. \eea The Frobenius number of the vector ${\ve a}$, $\frob_k({\ve a})$, is the largest positive integer that cannot be represented as $\su...
| Main Author: | |
|---|---|
| Published: |
Cardiff University
2015
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.704905 |