Exploiting Symmetries in the Computation of Graver Bases
classification
🧮 math.CO
keywords
graverbasesalgorithmbasischallengingcomputationcomputationallycomputations
read the original 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 $\Z^n$ that exploits existing symmetry.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.