Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.15569

On Dyck Path Expansion Formulas for Rank 2 Cluster Variables

Amanda Burcroff
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we simplify and generalize formulas for the expansion of rank 2 cluster variables. In particular, we prove an equivalent, but simpler, description of the colored Dyck subpaths framework introduced by Lee and Schiffler. We then prove the conjectured bijectivity of a map constructed by Feiyang Lin between collections of colored Dyck subpaths and compatible pairs, objects introduced by Lee, Li, and Zelevinsky to study the greedy basis. We use this bijection along with Rupel's expansion formula for quantum greedy basis elements, which sums over compatible pairs, to provide a quantum generalization of Lee and Schiffler's colored Dyck subpaths formula.

Explore related subjects

math.COmath.QAmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amanda Burcroff. 2022-12-12. On Dyck Path Expansion Formulas for Rank 2 Cluster Variables. https://arxiv.org/abs/2211.15569

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗