Search arXivSearch

arXiv · 2005.02083

Expansion Posets for Polygon Cluster Algebras

Abstract

Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion formula. We introduce an involution on several of the interrelated combinatorial objects and constructions associated to type $A$ surface cluster algebras, including certain classes of arcs, triangulations, and distributive lattices. We use these involutions to formulate a dual version of skein relations for arcs, and dual versions of three existing expansion posets. In particular, this leads to two new cluster expansion formulas, and recovers the lattice path expansion of Propp et al. We provide an explicit, structure-preserving poset isomorphism between an expansion poset and its dual version from the dual arc. We also show that an expansion poset and its dual version constructed from the same arc are dual in the sense of distributive lattices. We show that any expansion poset is isomorphic to a closed interval in one of the lattices $L(m,n)$ of Young diagrams contained in an $m \times n$ grid, and that any $L(m,n)$ has a covering by such intervals. We give two formulas for the rank function of any lattice path expansion poset, and prove that this rank function is unimodal whenever the underlying snake graph is built from at most four maximal straight segments. We show that the support of any type $A$ cluster variable is the orbit of a groupoid. Finally, in work joint with Nicholas Ovenhouse, we partially generalize $T$-paths to configurations of affine flags, and prove that a $T$-path expansion analogous to the type $A$ case holds when the initial seed is from a fan triangulation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Claussen. 2020-05-05. Expansion Posets for Polygon Cluster Algebras. https://arxiv.org/abs/2005.02083

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

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO