Open Access
2012 Universal Gröbner Bases of Colored Partition Identities
Tristram Bogart, Ray Hemmecke, Sonja Petrovíc
Experiment. Math. 21(4): 395-401 (2012).

Abstract

Associated to any toric ideal are two special generating sets: the universal Gröbner basis and the Graver basis, which encode polyhedral and combinatorial properties of the ideal, or equivalently, its defining matrix. If the two sets coincide, then the complexity of the Graver bases of the higher Lawrence liftings of the toric matrices is bounded.

While a general classification of all matrices for which both sets agree is far from known, we identify all such matrices within two families of nonunimodular matrices, namely, those defining rational normal scrolls and those encoding homogeneous primitive colored partition identities. This also allows us to show that higher Lawrence liftings of matrices with fixed Gröbner and Graver complexities do not preserve equality of the two bases.

The proof of our classification combines computations with the theoretical tool of Graver complexity of a pair of matrices.

Citation

Download Citation

Tristram Bogart. Ray Hemmecke. Sonja Petrovíc. "Universal Gröbner Bases of Colored Partition Identities." Experiment. Math. 21 (4) 395 - 401, 2012.

Information

Published: 2012
First available in Project Euclid: 20 December 2012

zbMATH: 1259.05195
MathSciNet: MR3004255

Subjects:
Primary: 05E40 , 11P84 , 13P10 , 90C27

Keywords: colored partitions , Graver bases , partition identities , rational normal scrolls , state polytope , toric ideal , universal Gröbner bases

Rights: Copyright © 2012 A K Peters, Ltd.

Vol.21 • No. 4 • 2012
Back to Top