The cluster embedding of the Grassmannian Gr(3,6)
Consider the homogeneous coordinate ring A
3,6 of the Grassmannain Gr(3,6) with respect to its Plücker embedding.
A description readable by Macaulay2 can be found here:
A3,6.
It is a cluster algebra of finite cluster type D
4 with six frozen directions.
This cluster algebra has 22 cluster variables:
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.
The cluster variables of form p
ijk are the usual Plücker coordinates and the six frozen variables correspond to Plücker coordinates whose indexing sets are (cyclic) intervals:
p
123, p
234, p
345, p
456, p
156, p
126.
The additional two cluster variabels X and Y can be expressed as homogeneous binomials of degree two in the Plücker coordinates:
X = p
145p
246 - p
123p
456, and Y = p
125p
346 - p
126p
345.
We define a map from the polynomial ring in cluster variables ℂ[p
123,..., p
456, X, Y] to A
3,6 sending each variables to its corresponding coset in A
3,6.
The map is surjective and we denote its kernel by I
ex. The ideal in Macaulay2 friendly form is here:
Iex.
Eliminating the variables X and Y from I
ex gives back the the Plücker ideal defining Gr(3,6) (see the file
A3,6).
The quotient of ℂ[p
123,..., p
456, X, Y] by I
ex (we denote it by A from now on) is isomorphic to A
3,6.
Moreover, this is an isomorphism of graded algeberas: A has the non-standard grading where the Plücker coordinates are of degree 1 and the variables X and Y of degree 2.
The vanishing set V(I
ex) is a weighted projective variety inside the weighted projective space ℙ(d) where
d=(1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2)
As weighted projective variety V(I
ex) and Gr(3,6) are isomorphic. We therefore call V(I
ex) the
cluster embedding of Gr(3,6).
In fact, the ideal I
ex contains all 52 exchange relations of the cluster algebra A
3,6, you can find them here:
exchange relations.
The first monomial of each 3-term exchange relation (as they are written in the file) is what we call the
exchange monomial.
The other two terms are cluster monomials.
However, the exchange relations do not generate the ideal I
ex, as can be seen from comparing the minimal generating set given in
Iex to the
exchange relations.