ﻻ يوجد ملخص باللغة العربية
We consider the Graver basis, the universal Groebner basis, a Markov basis and the set of the circuits of a toric ideal. Let $A, B$ be any two of these bases such that $A ot subset B$, we prove that there is no polynomial on the size or on the maximal degree of the elements of $B$ which bounds the size or the maximal degree of the elements of $A$ correspondingly.
It has been well-known that for two-way contingency tables with fixed row sums and column sums the set of square-free moves of degree two forms a Markov basis. However when we impose an additional constraint that the sum of a subtable is also fixed,
We extend the theory and the algorithms of Border Bases to systems of Laurent polynomial equations, defining toric roots. Instead of introducing new variables and new relations to saturate by the variable inverses, we propose a more efficient approac
The main objects of the present paper are (i) Hibi rings (toric rings arising from order polytopes of posets), (ii) stable set rings (toric rings arising from stable set polytopes of perfect graphs), and (iii) edge rings (toric rings arising from edg
In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under direct sum
We develop an analogue of Eisenbud-Floystad-Schreyers Tate resolutions for toric varieties. Our construction, which is given by a noncommutative analogue of a Fourier-Mukai transform, works quite generally and provides a new perspective on the relati