Title

The Frobenius Problem and Maximal Lattice Free Bodies

Document Type

Discussion Paper

Publication Date

6-1-1990

CFDP Number

945

CFDP Pages

12

Abstract

Let p = ( p 1 ,…, p n ) be a vector of positive integers whose greatest common divisor is unity. The Frobenius problem is to find the largest integer f * which cannot be written as a non-negative integral combination of the p i . In this note we relate the Frobenius problem to the topic of maximal lattice free bodies and describe an algorithm for n = 3.

This document is currently not available here.

Share

COinS