skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Consistent dimer models on surfaces with boundary
A dimer model is a quiver with faces embedded in a surface. We define and investigate notions of consistency for dimer models on general surfaces with boundary which restrict to well-studied consistency conditions in the disk and torus case. We define weak consistency in terms of the associated dimer algebra and show that it is equivalent to the absence of bad configurations on the strand diagram. In the disk and torus case, weakly consistent models are nondegenerate, meaning that every arrow is contained in a perfect matching; this is not true for general surfaces. Strong consistency is defined to require weak consistency as well as nondegeneracy. We prove that the completed as well as the noncompleted dimer algebra of a strongly consistent dimer model are bimodule internally 3-Calabi-Yau with respect to their boundary idempotents. As a consequence, the Gorenstein-projective module category of the completed boundary algebra of suitable dimer models categorifies the cluster algebra given by their underlying quiver. We provide additional consequences of weak and strong consistency, including that one may reduce a strongly consistent dimer model by removing digons and that consistency behaves well under taking dimer submodels.  more » « less
Award ID(s):
2054255
PAR ID:
10641401
Author(s) / Creator(s):
;
Publisher / Repository:
Cambridge University Press
Date Published:
Journal Name:
Forum of Mathematics, Sigma
Volume:
13
ISSN:
2050-5094
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract In this article, we continue the study of a certain family of 2-Calabi–Yau tilted algebras, called dimer tree algebras. The terminology comes from the fact that these algebras can also be realized as quotients of dimer algebras on a disk. They are defined by a quiver with potential whose dual graph is a tree, and they are generally of wild representation type. Given such an algebra $$B$$, we construct a polygon $$\mathcal {S}$$ with a checkerboard pattern in its interior, which defines a category $$\text {Diag}(\mathcal {S})$$. The indecomposable objects of $$\text {Diag}(\mathcal {S})$$ are the 2-diagonals in $$\mathcal {S}$$, and its morphisms are certain pivoting moves between the 2-diagonals. We prove that the category $$\text {Diag}(\mathcal {S})$$ is equivalent to the stable syzygy category of the algebra $$B$$. This result was conjectured by the authors in an earlier paper, where it was proved in the special case where every chordless cycle is of length three. As a consequence, we conclude that the number of indecomposable syzygies is finite, and moreover the syzygy category is equivalent to the 2-cluster category of type $$\mathbb {A}$$. In addition, we obtain an explicit description of the projective resolutions, which are periodic. Finally, the number of vertices of the polygon $$\mathcal {S}$$ is a derived invariant and a singular invariant for dimer tree algebras, which can be easily computed form the quiver. 
    more » « less
  2. We define a combinatorial model for $$F$$-polynomials and $$g$$-vectors for type $$D_n$$ cluster algebras where the associated quiver is acyclic. Our model utilizes a combination of dimer configurations and double dimer configurations which we refer to as mixed dimer configurations. In particular, we give a graph theoretic recipe that describes which monomials appear in such $$F$$-polynomials, as well as a graph theoretic way to determine the coefficients of each of these monomials. In addition, we prove that a weighting on our mixed dimer configuration model yields the associated $$g$$-vector. To prove this formula, we use a combinatorial formula due to Thao Tran (arXiv:0911.4462, 2009) and provide explicit bijections between her combinatorial model and our own. 
    more » « less
  3. null (Ed.)
    The purpose of this paper was to give a demonstration of the primary materials and methods we used in learning communities (LCs) for biology students. The LCs were based on the performance pyramid theoretical structure. The objectives were to show the pedagogical links biological and mathematical concepts through co-curricular projects; assess students’ perceptions of the performance pyramid model, and demonstrate a method for assessing LC efficacy directly related to General Biology I and College Algebra course content. Forty-eight students were recruited into the LCs with 39 students completing the LCs. The participants completed co-curricular projects that linked biology and mathematics course content with guidance from a peer leader. The LC participants completed the Augmented Student Support Needs Scale (SSNS-A) to assess perceptions of performance pyramid elements, as well as separate biology and mathematics quizzes related to their General Biology I and College Algebra courses, respectively. It was found that all co-curricular projects had biology and mathematics learning objective and outcomes. The SSNS-A had adequate internal consistency for appraising multiple aspects of the performance pyramid in general. However, some aspects and student responses might need more clarification. The quizzes had adequate internal consistency and LC students had large gains in biology (d = 1.88) and mathematics (d = 2.62) knowledge and skills from the beginning to end of their General Biology I and College Algebra courses. Promising aspects and limitations the LC activities and assessments are discussed. 
    more » « less
  4. Programming concurrent, distributed systems is hard---especially when these systems mutate shared, persistent state replicated at geographic scale. To enable high availability and scalability, a new class of weakly consistent data stores has become popular. However, some data needs strong consistency. To manipulate both weakly and strongly consistent data in a single transaction, we introduce a new abstraction: mixed-consistency transactions, embodied in a new embedded language, MixT. Programmers explicitly associate consistency models with remote storage sites; each atomic, isolated transaction can access a mixture of data with different consistency models. Compile-time information-flow checking, applied to consistency models, ensures that these models are mixed safely and enables the compiler to automatically partition transactions. New run-time mechanisms ensure that consistency models can also be mixed safely, even when the data used by a transaction resides on separate, mutually unaware stores. Performance measurements show that despite their stronger guarantees, mixed-consistency transactions retain much of the speed of weak consistency, significantly outperforming traditional serializable transactions. 
    more » « less
  5. Abstract In this work we study the asymptotic consistency of the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) in the identification of differential equations from noisy samples of solutions. We prove that the WSINDy estimator is unconditionally asymptotically consistent for a wide class of models that includes the Navier–Stokes, Kuramoto–Sivashinsky and Sine–Gordon equations. We thus provide a mathematically rigorous explanation for the observed robustness to noise of weak-form equation learning. Conversely, we also show that, in general, the WSINDy estimator is only conditionally asymptotically consistent, yielding discovery of spurious terms with probability one if the noise level exceeds a critical threshold $$\sigma _{c}$$. We provide explicit bounds on $$\sigma _{c}$$ in the case of Gaussian white noise and we explicitly characterize the spurious terms that arise in the case of trigonometric and/or polynomial libraries. Furthermore, we show that, if the data is suitably denoised (a simple moving average filter is sufficient), then asymptotic consistency is recovered for models with locally-Lipschitz, polynomial-growth nonlinearities. Our results reveal important aspects of weak-form equation learning, which may be used to improve future algorithms. We demonstrate our findings numerically using the Lorenz system, the cubic oscillator, a viscous Burgers-growth model and a Kuramoto–Sivashinsky-type high-order PDE. 
    more » « less