 |
Discrete Mathematics & Theoretical Computer Science |
2336
In-Jee Jeong ; Gregg Musiker ; Sicong Zhang - Gale-Robinson Sequences and Brane Tilings
dmtcs:2336 - Discrete Mathematics & Theoretical Computer Science, January 1, 2013, DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013) - https://doi.org/10.46298/dmtcs.2336Gale-Robinson Sequences and Brane Tilings
- 1 Department of Mathematics
- 2 School of Mathematics
- 3 Department of Mathematics [New York]
We study variants of Gale-Robinson sequences, as motivated by cluster algebras with principal coefficients. For such cases, we give combinatorial interpretations of cluster variables using brane tilings, as from the physics literature.
Source: HAL:hal-01229673v1
Volume: DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Section: Proceedings
Published on: January 1, 2013
Imported on: November 21, 2016
Keywords: Gale-Robinson recurrence,perfect matchings,brane tilings,Seiberg dualities,F-polynomials,Aztec diamonds,cluster algebras,principal coefficients,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
Funding:
- Source : OpenAIRE Graph
- Reflection Group Combinatorics; Funder: National Science Foundation; Code: 1001933
- RTG in Combinatorics; Funder: National Science Foundation; Code: 1148634
- Cluster algebras, critical groups, and tropical curves; Funder: National Science Foundation; Code: 1067183
Linked publications - datasets - softwares
|
Source : ScholeXplorer
IsRelatedTo ARXIV 1511.05535 Source : ScholeXplorer IsRelatedTo DOI 10.37236/5698 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1511.05535
|
3 Documents citing this article
Consultation statistics
This page has been seen 320 times.
This article's PDF has been downloaded 501 times.