IJPAM: Volume 81, No. 1 (2012)

A VARIANT OF THE GRÖBNER BASIS ALGORITHM
FOR COMPUTING HILBERT BASES

Natalia Dück$^1$, Karl-Heinz Zimmermann$^2$
$^{1,2}$Hamburg University of Technology
Schwarzenbergstr. 95E, Hamburg 21073, GERMANY


Abstract. Gröbner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field given as a matrix kernel.

Received: July 31, 2012

AMS Subject Classification: 13P10, 94B05

Key Words and Phrases: Gröbner basis, integer programming, monoid, Hilbert basis, linear code

Download paper from here.


Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2012
Volume: 81
Issue: 1