Exploiting Symmetries in the Computation of Graver Bases

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 ${\mathbb{Z}}^n$ that exploits existing symmetry.

References in corpus (1)

• Test Sets for Integer Programs with Z-Convex Objective

Cited by in corpus (1)

• Computing generating sets of lattice ideals