Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 161 tok/s Pro
GPT OSS 120B 412 tok/s Pro
Claude Sonnet 4 35 tok/s Pro
2000 character limit reached

Dimers, webs, and positroids (1404.3317v1)

Published 12 Apr 2014 in math.CO and math.AG

Abstract: We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative Grassmannian. Considering pairing probabilities for the double-dimer model gives rise to Grassmann analogues of Rhoades and Skandera's Temperley-Lieb immanants. The same problem for the (probably novel) triple-dimer model gives rise to the combinatorics of Kuperberg's webs and Grassmann analogues of Pylyavskyy's web immanants. This draws a connection between the square move of plabic graphs (or urban renewal of planar bipartite graphs), and Kuperberg's square reduction of webs. Our results also suggest that canonical-like bases might be applied to the dimer model. We furthermore show that these functions on the Grassmannian are compatible with restriction to positroid varieties. Namely, our construction gives bases for the degree two and degree three components of the homogeneous coordinate ring of a positroid variety that are compatible with the cyclic group action.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.