A maximal cone in the Gröbner fan of Iex
We study the Gröbner fan of the ideal corresponding to the
cluster embedding of Gr(3,6).
It should be mentioned that we work with weights rather than term orders and that we use the minimum convention.
It is an ideal inside a polynomial ring with 22 variables denoted by
p
123, p
124, p
125, p
126, p
134, p
135, p
136, p
145, p
146, p
156,
p
234, p
235, p
236, p
245, p
246, p
256, p
345, p
346, p
356, p
456, X, Y.
We call it I
ex and a minimal generating set for it can be found here:
Iex.
The Gröbner fan of I
ex, written GF(I
ex), contains a 6-dimensional linear subspace, called the
lineality space.
It is generated by the following elements (written with respect to the order of variables above):
l
1 = (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1),
l
2 = (1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1),
l
3 = (1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1),
l
4 = (0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1),
l
5 = (0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1),
l
6 = (0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1).
Inside GF(I
ex) we identify a maximal cone C. Besides the lineality space C is generated by the following rays:
r
1 = (0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0),
r
2 = (1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 2, 2),
r
3 = (0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1),
r
4 = (1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 3, 2),
r
5 = (1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 2, 1),
r
6 = (1, 1, 1, 0, 1, 1, 0, 2, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 2, 1),
r
7 = (0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0),
r
8 = (1, 2, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 2),
r
9 = (2, 3, 2, 1, 3, 2, 1, 3, 2, 1, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 3, 3),
r
10 = (2, 3, 2, 1, 3, 2, 1, 3, 2, 2, 2, 1, 0, 2, 1, 1, 2, 1, 1, 2, 3, 4),
r
11 = (2, 3, 3, 2, 3, 2, 1, 3, 2, 2, 2, 1, 0, 2, 1, 1, 2, 1, 1, 2, 3, 4),
r
12 = (1, 1, 1, 2, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 2),
r
13 = (1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 2, 1),
r
14 = (1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1),
r
15 = (1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1),
r
16 = (1, 2, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 2).
A more copy-paste friendly version of the generators for the lineality space and the rays can be found here:
rays and lineality space.
To verify that the cone is maximal, we compute the initial ideal of I
ex with respect to the weight vector
w = (16, 19, 16, 16, 16, 11, 10, 19, 16, 16, 16, 10, 7, 16, 11, 10, 16, 10, 7, 16, 27, 27),
which is the sum of all the rays and therefore in the relative interior of C.
The initial ideal has 54 generators that are monomials of degree 2.
The generators as well as the computation in Macaulay2 can be found here:
monomial ideal.
In fact, we obtained the cone C in a kind of backwards way:
given the
exchange relations of the cluster algebras A
3,6 we were looking for an initial ideal of I
ex that contains all exchange monomials (the first monomial of each 3-term polynomial as written in the file).
So from every exchange relation we obtained two inequalities that the cone C should satisfy:
the weight of each of the other two monomials is less or equal to the weight of the exchange monomial.
For example, one exchange relation is
p
246p
356 - p
346p
256 - p
236p
456.
The monomial p
246p
356 is the exchange monomial. Let w
ijk denote the weight of a variable p
ijk.
Then the above relation defines two inequalities:
w
246 + w
356 ≤ w
346 + w
256, and w
246 + w
356 ≤ w
236 + w
456.
We proceeded in this way with all exchange relations and defined a cone in
polymake. The outcome is the cone C.
Note that surprisingly the inequalities deduced from the exchange relations already determine C uniquely.
We verified this afterwards using the same technique on the reduced Gröbner basis for I
ex with respect to C.
The reduced Gröbner basis has 54 elements, 52 of which are exchange relations.
They can be found in this file:
reduced Gröbner basis.