Exploiting Symmetries in the Computation of Graver Bases
Combinatorics
2007-05-23 v1
Abstract
Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices of that exploits existing symmetry.
Cite
@article{arxiv.math/0410334,
title = {Exploiting Symmetries in the Computation of Graver Bases},
author = {Raymond Hemmecke},
journal= {arXiv preprint arXiv:math/0410334},
year = {2007}
}