Search arXivSearch

arXiv · 1511.02699

Cluster Algebras of Type $D_4$, Tropical Planes, and the Positive Tropical Grassmannian

Abstract

We show that the number of combinatorial types of clusters of type $D_4$ modulo reflection-rotation is exactly equal to the number of combinatorial types of tropical planes in $\mathbb{TP}^5$. This follows from a result of Sturmfels and Speyer which classifies these tropical planes into seven combinatorial classes using a detailed study of the tropical Grassmannian $\operatorname{Gr}(3,6)$. Speyer and Williams show that the positive part $\operatorname{Gr}^+(3,6)$ of this tropical Grassmannian is combinatorially equivalent to a small coarsening of the cluster fan of type $D_4$. We provide a structural bijection between the rays of $\operatorname{Gr}^+(3,6)$ and the almost positive roots of type $D_4$ which makes this connection more precise. This bijection allows us to use the pseudotriangulations model of the cluster algebra of type $D_4$ to describe the equivalence of "positive" tropical planes in $\mathbb{TP}^5$, giving a combinatorial model which characterizes the combinatorial types of tropical planes using automorphisms of pseudotriangulations of the octogon.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sarah B. Brodsky, Cesar Ceballos, Jean-Philippe Labbé. 2015-11-09. Cluster Algebras of Type $D_4$, Tropical Planes, and the Positive Tropical Grassmannian. https://arxiv.org/abs/1511.02699

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO