Exploiting Symmetries in the Computation of Graver Bases

Simple item page
dc.creatorHemmecke, Raymond
dc.date2004-10-14
dc.date.accessioned2026-07-07T05:13:17Z
dc.date.available2026-07-07T05:13:17Z
dc.descriptionMany 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.
dc.identifierhttps://arxiv.org/abs/math/0410334
dc.identifierhttp://arxiv.org/abs/math/0410334
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72887
dc.subjectCombinatorics
dc.titleExploiting Symmetries in the Computation of Graver Bases
dc.typetext

Files

Collections

arXiv