Matchings and Clusters on Plabic Fences
Abstract
Fix two positive braid words β+,β-, and let Conf(β+,β-) be the corresponding (type A) double Bott-Samelson variety. Let β be a double braid word containing β+,β- as the top, bottom words. We consider the open cluster torus T(Cβ) associated to a triangulation Cβ in Conf(β+,β-) from arXiv:1904.07992, and we identify these with weighted plabic fences, where the usual local moves on planar bipartite graphs naturally correspond to change of torus coordinates in double Bott-Samelson variety. Moreover, T(Cβ) can be parametrized explicitly by certain matrix products, and also has monomial coordinates given by the cluster variables, which are matrix minors. We interpret these minors as a generalized notion of perfect matchings on weighted plabic fences, which may not be reduced plabic graphs. Using this interpretation, we show that the cluster variables are given by "generalized minimal matchings", extending the minimal matchings from arXiv:1606.08383. Lastly, we derive a Chamber Ansatz formula for double Bott-Samelson varieties via face alternating products from dimer theory. In general, plabic fences are not reduced plabic graphs, yet we are able to extend and apply the standard tools such as local moves on plabic graphs, trips, and minimal matchings to them.
Related
- Tiling circular n-boards with squares and (1,1)-fences
- Plabic promotions beyond cluster: quantum cluster structures and the dual canonical basis
- Random Signs into Matchings: A Godsil-Gutman Identity, Formalized in Lean 4 (Part I)
- Spanning Even Linear Forests with Isolated Edges Share the Anti-Ramsey Numbers of Perfect Matchings
- Balanced weightings and permutation matchings applied to the monoid of order-preserving mappings
BibTeX
@misc{carvalho2026matchings,
title = {{Matchings and Clusters on Plabic Fences}},
author = {João Pedro Carvalho and Yucong Lei},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.08694},
eprint = {2609.08694},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.08694},
}
RIS
TY - UNPB
TI - Matchings and Clusters on Plabic Fences
AU - João Pedro Carvalho
AU - Yucong Lei
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.08694
UR - https://arxiv.org/abs/2609.08694
AB - Fix two positive braid words β_+,β_-, and let Conf(β_+,β_-) be the corresponding (type A) double Bott-Samelson variety. Let β be a double braid word containing β_+,β_- as the top, bottom words. We consider the open cluster torus T(C_β) associated to a triangulation C_β in Conf(β_+,β_-) from arXiv:1904.07992, and we identify these with weighted plabic fences, where the usual local moves on planar bipartite graphs naturally correspond to change of torus coordinates in double Bott-Samelson variety. Moreover, T(C_β) can be parametrized explicitly by certain matrix products, and also has monomial coordinates given by the cluster variables, which are matrix minors. We interpret these minors as a generalized notion of perfect matchings on weighted plabic fences, which may not be reduced plabic graphs. Using this interpretation, we show that the cluster variables are given by "generalized minimal matchings", extending the minimal matchings from arXiv:1606.08383. Lastly, we derive a Chamber Ansatz formula for double Bott-Samelson varieties via face alternating products from dimer theory. In general, plabic fences are not reduced plabic graphs, yet we are able to extend and apply the standard tools such as local moves on plabic graphs, trips, and minimal matchings to them.
ER -