On the Computation of Hilbert Bases and Extreme Rays of Cones
Raymond Hemmecke
Abstract
In this paper we present a novel project-and-lift approach to compute the set of minimal generators of the semigroup (Λn+,+) for lattices Λ⊂eqn. This problem class includes the computation of Hilbert bases of cones \z:Az=0,z∈n+\ for integer matrices A. A similar approach can be used to compute only the extreme rays of such cones. Finally, some combinatorial applications and computational experience are presented.
Create a lesson
Related papers
Elementary Proofs of Commonality of the House Graph and K4 with One Edge Subdivided
Hao Chen
Cop number of Pk-free graphs without a claw or a fork
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
Connectivity keeping pendant extensions of paths in k-connected triangle-free graphs
Menghan Ma, Qinghai Liu, Liping Zhang et al.
Maximal subsets of n× n board without cycles
Giedrius Alkauskas
Sequence Factory: Families of Integer Sequences Generated by Gödel Implication
Volkan Yildiz
Avoiding a partial Latin square with an isotope of a given Latin square
Stijn Cambie, Ian M. Wanless