Otto-von-Guericke-Universität Magdeburg

 
 
 
 
 
 
 
 

09-40

by Henk, M.; Aliev, I., Hinrichs, A.

 

Preprint series: 09-40, Preprints

The paper is published: to appear in journal of combinatorial theory, series a

MSC:
11H06 Lattices and convex bodies, See also {11P21, 52C05, 52C07}
11D85 Representation problems, See also {11P55}
90C10 Integer programming

 

Abstract: We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.

Keywords: number Theory, Combinatorics


The author(s) agree, that this abstract may be stored asfull text and distributed as such by abstracting services.

Letzte Änderung: 10.02.2016 - Ansprechpartner: Pierre Krenzlin