A counterexample to an integer analogue of Carathéodory's theorem

Journal fur die Reine und Angewandte Mathematik

Volumn 510, Issue , 1999, Pages 179-185

  Bruns, Winfried ^a   Gubeladze, Joseph ^b   Henk, Martin ^d   Martin, Alexander ^c   Weismantel, Robert ^d  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b A RAZMADZE MATHEMATICAL INSTITUTE   (Georgia)

^c ZUSE INSTITUTE BERLIN   (Germany)

^d OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040942599     PISSN: 00754102     EISSN: None     Source Type: Journal    
DOI: 10.1515/crll.1999.045     Document Type: Article

References (12)

1. [BGS] C. Bouvier and G. Gonzalez-Sprinberg, Système générateurs minimal, diviseurs essentiels et G-désingularizations de variétés toriques, Tôhoku Math. J. 46 (1994), 125-149.
2. [BG] W. Bruns and J. Gubeladze, Normality and covering properties, J. reine angew. Math. 510 (1999), 161-178.
3. [BK] W. Bruns and R. Koch, Normaliz - a program to compute normalizations of semigroups, available from mathematik.uni-osnabrueck.de by anonymous ftp, directory "/pub/osm/kommalg/software".
4. [CFS] W. Cook, J. Fonlupt and A. Schrijver, An integer analogue of Carathéodory's theorem, J. Comb. Th. (B) 40 (1986), 63-70.
5. [Cor] J.G. van der Corupt, Über Systeme von linear-homogenen Gleichungen und Ungleichungen, Proc. Kon. Nederl. Akad. Wetensch. 34 (1931), 368-371.
6. [FZ] R.T. Firla and G.M. Ziegler, Hilberts bases, unimodular triangulations, and binary covers of rational polyhedral cones, Disc. Comp. Geom. 21 (1999), 205-216.
7. [GP] F.R. Giles and W.R. Pulleyblank, Total dual integrality and integer polyhedra, Lin. Alg. Appl. 25 (1979), 191-196.
8. [HW] M. Henk and R. Weismantel, Test sets of the knapsack problem and simultaneous diophantine approximation, Algorithms-ESA'97, R. Burkhard and G. Woeginger (ed.), Lect. notes comp. sci. 1284 (1997), 259-271.
9. [M] A. Martin, Integer Programs with Block Structure, Habilitationsschrift, TU Berlin, 1998.
10. [MW] A. Martin and R. Weismantel, Conjunctive Cuts for Integer Programs, preprint, Konrad-Zuse-Zentrum Berlin, SC 98-18, 1998.
11. [Pot] L. Pottier, Euclide's algorithm in dimension n, ISSAC 96, ACM Press, (1998), program bastat available via http://www.inria.fr/croap/personnel/Loic.Pottier/Bastat/bastat demo.html.
12. [Seb] A. Sebö, Hilbert bases, Carathéodory's Theorem and combinatorial optimization, Proc. of the IPCO conference, Waterloo, Canada (1990), 431-455.