Skip to main content
Open Access Publications from the University of California

Department of Mathematics

Faculty bannerUC Davis

Short rational functions for toric algebra and applications


We encode the binomials belonging to the toric ideal IAassociated with an integral d×n matrix A using a short sum of rational functions as introduced by Barvinok (Math. Operations Research 19 (1994) 769) and Barvinok and Woods (J. Amer. Math. Soc. 16 (2003) 957). Under the assumption that d and n are fixed, this representation allows us to compute a universal Gröbner basis and the reduced Gröbner basis of the ideal IA, with respect to any term order, in time polynomial in the size of the input. We also derive a polynomial time algorithm for normal form computations which replaces in this new encoding the usual reductions typical of the division algorithm. We describe other applications, such as the computation of Hilbert series of normal semigroup rings, and we indicate applications to enumerative combinatorics, integer programming, and statistics. © 2004 Elsevier Ltd. All rights reserved.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View