A Variant of the Gr\"obner Basis Algorithm for Computing Hilbert Bases
Algebraic Geometry
2013-03-27 v1 Symbolic Computation
Commutative Algebra
Abstract
Gr\"obner 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.
Cite
@article{arxiv.1303.6296,
title = {A Variant of the Gr\"obner Basis Algorithm for Computing Hilbert Bases},
author = {Natalia Dück and Karl-Heinz Zimmermann},
journal= {arXiv preprint arXiv:1303.6296},
year = {2013}
}
Comments
11 pages