Combinatorics of the Del-Pezzo 3 Quiver: Aztec Dragons, Castles, and Beyond

Size: px
Start display at page:

Download "Combinatorics of the Del-Pezzo 3 Quiver: Aztec Dragons, Castles, and Beyond"

Transcription

1 Combinatorics of the Del-Pezzo Quiver: Aztec Dragons, Castles, and Beyond Tri Lai (IMA) and Gregg Musiker (University of Minnesota) AMS Special Session on Integrable Combinatorics March, 0 http//math.umn.edu/ musiker/beyond.pdf Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

2 Outline Introducing the del Pezzo Quiver Contours in the Honeycomb Lattice Reimagining the Aztec Castles of Leoni-M-Neel-Turner A Third Direction Further Directions Thank you to NSF Grants DMS-078, DMS-8, DMS-980, and the Institute for Mathematics and its Applications. http//math.umn.edu/ musiker/beyond.pdf Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

3 Motivations beyond studying Bipartite Graphs on a Torus Clust. Int. System Poisson Struct. Newton Polygon Bip. Graph In String Theory, referred to as Brane Tilings and appear When studying intersections of NS and D-branes or the geometry in a (+)-dimensional N = supersymmetric quiver gauge theory. In Algebraic Geometry, they are used to Probe certain toric Calabi-Yau singularities, and relate to non-commutative crepant resolutions and the -dimensional McKay correspondence. Certain examples of path algebras with relations (Jacobian Algebras) (also known as Dimer Algebras or Superpotential Algebras) can be constructed by a quiver and potential (Q 0, Q, Q ) dual to a bipartite graph on a surface. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

4 Brane Tilings (Combinatorially) Physicists/Geometers use Kasteleyn matrix and weighted enumeration of perfect matchings of these bipartite graphs to obtain bivariate Laurent polynomials whose Newton polygon recovers toric data of variety whose coordinate ring is center of corresponding Jacobian algebra Examples:, 7 We will instead view such tessellations as doubly-periodic tessellations of its universal cover, the Euclidean plane. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

5 Brane Tilings from a Quiver Q with Potential W A Brane Tiling can be associated to a pair (Q, W ), where Q is a quiver and W is a potential (called a superpotential in the physics literature). A quiver Q is a directed graph where each edge is referred to as an arrow. A potential W is a linear combination of cyclic paths in Q (possibly an infinite linear combination). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

6 Brane Tilings from a Quiver Q with Potential W A Brane Tiling can be associated to a pair (Q, W ), where Q is a quiver and W is a potential (called a superpotential in the physics literature). A quiver Q is a directed graph where each edge is referred to as an arrow. A potential W is a linear combination of cyclic paths in Q (possibly an infinite linear combination). For combinatorial purposes, we assume other conditions on (Q, W ): Each arrow of Q appears in one term of W with a positive sign, and one term with a negative sign. The number of terms of W with a positive sign equals the number with a negative sign. All coefficients in W are ±. Also, #V #E + #F = 0 where F = {terms in the potential}. Lastly, by a result of Vitoria, we wish to focus on potentials where no subpath of length two appears twice. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

7 The Del Pezzo Quiver We now consider the quiver and potential whose associated Calabi-Yau -fold is the cone over CP blown up at three points. Its Toric Diagram = {(, ), (0, ), (, 0), (, ), (0, ), (, 0), (0, 0)}. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

8 The Del Pezzo Quiver We now consider the quiver and potential whose associated Calabi-Yau -fold is the cone over CP blown up at three points. Its Toric Diagram = {(, ), (0, ), (, 0), (, ), (0, ), (, 0), (0, 0)}. Q dp = Q =, W = A A A A A A + A A A + A A A A A A A A A A A A A A A. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

9 The Del Pezzo Quiver (continued) We now unfold Q onto the plane, letting the three positive (resp. negative) terms in W depict clockwise (resp. counter-clockwise) cycles on Q. F C A D B F E F C D A B F Q = unfolds to Q = W = A A A A A A (A) + A A A (B) + A A A (C) A A A A (D) A A A A (E) A A A A (F ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

10 The Del Pezzo Quiver (continued) Taking the planar dual yields a bipartite graph on a torus (Brane Tiling): F A D B A C F E F F B D C Q T Q = F A D B A C F F F B D E B E C B D C Negative Term in W Counter-Clockwise cycle in Q in T Q Positive Term in W Clockwise cycle in Q in T Q (To obtain Q from T Q, we dualize edges so that white is on the right.) Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 8 /

11 The Del Pezzo Quiver (continued) Summarizing the dp Example: Q T Q Negative Term in W Counter-Clockwise cycle in Q in T Q Positive Term in W Clockwise cycle in Q in T Q Doubly periodic Perfect Matchings points in Toric Diagram. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 9 /

12 Quiver Mutation (a.k.a. Seiberg Duality in Physics) Pick vertex j of Q. () For every two path i j k, add a new arrow i k. () Reverse all arrows incident to j. () Delete any -cycles. Example: Start with dp and mutate at vertices,, and in order. Together, these are known as the Four Toric Phases of dp. Note that we only mutate at vertices with in-degree and out-degree. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

13 Toric Phases of dp (Models I, II, III, and IV) Toric mutations take place at vertices with in-degree and out-degree. Compare with Figure 7 of Eager-Franco ( Colored BPS Pyramid Partition Functions, Quivers and Cluster Transformations ) Lai-M (IMA and Univ. Minnesota) I The dp Quiver: II Aztec Castles III and Beyond IV Et Tu Brutus /

14 Toric Phases of dp (Models I, II, III, and IV) Toric mutations take place at vertices with in-degree and out-degree. Starting with any of these four models of the dp quiver, any sequence of toric mutations yields a quiver that is graph isomorphic to one of these. Figure 0 of Eager-Franco (Incidences betweeen these Models): Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

15 Cluster Variable Mutation In addition to the mutation of quivers, there is also a complementary cluster mutation that can be defined. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

16 Cluster Variable Mutation In addition to the mutation of quivers, there is also a complementary cluster mutation that can be defined. Cluster mutation yields a sequence of Laurent polynomials in Q(x, x,..., x n ) known as cluster variables. Given a quiver Q (the potential is irrelevant here) and an initial cluster {x,..., x N }, then mutating at vertex k yields a new cluster variable x k defined by x k = x i + / x k. k i Q i k Q x i Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

17 Cluster Variable Mutation In addition to the mutation of quivers, there is also a complementary cluster mutation that can be defined. Cluster mutation yields a sequence of Laurent polynomials in Q(x, x,..., x n ) known as cluster variables. Given a quiver Q (the potential is irrelevant here) and an initial cluster {x,..., x N }, then mutating at vertex k yields a new cluster variable x k defined by x k = x i + / x k. k i Q i k Q Example: Mutating the dp quiver periodically at,,,,,,,,... yields Laurent polynomials x x +x x x, x x +x x x, x x x +x x x x +x x x x +x x x x x x, x x x +x x x x +x x x x +x x x x x x, (x x +x x )(x x +x x )(x x +x x ) x x x x x, (x x +x x )(x x +x x )(x x +x x ) x x x x x,... Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus / x i

18 Goal: Combinatorial Formula for Cluster Variables Example from S. Zhang (0 REU): Periodic mutation,,,,,,,,... yields partition functions for Aztec Dragons (as studied by Ciucu, Cottrell-Young, and Propp) under appropriate weighted enumeration of perfect matchings. x x +x x x x x +x x x x x x +x x x x +x x x x +x x x x x x x x x +x x x x +x x x x +x x x x x x (x x +x x )(x x +x x )(x x +x x ) x x x x x (x x +x x )(x x +x x )(x x +x x ) x x x x x Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

19 Goal: Combinatorial Formula for Cluster Variables Example from M. Leoni, S. Neel, and P. Turner (0 REU): Mutations at antipodal vertices of dp quiver yield τ-mutation sequences. Resulting Laurent polynomials correspond to Aztec Castles under appropriate weighted enumeration of perfect matchings. e.g.,,,,,,, yields cluster variable (x x x x + x x x x + x x x x x + x x x x x x + x x x x x + x x x x + x x x x x x + x x x x x x + x x x x + x x x x x + x x x x x x + x x x x x + x x x x + x x x x )/x x x x x = (x x + x x )(x x + x x ) (x x + x x ) x x x x x Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

20 Introducing Contours on the del Pezzo Lattice We wish to understand combinatorial interpretations for more general toric mutation sequences, not necessarily periodic or coming from mutating at antipodes. To this end, we cut out subgraphs of the dp lattice by using six-sided contours a b c d e f indexed as (a, b, c, d, e, f ) with a, b, c, d, e, f Z. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

21 Introducing Contours on the del Pezzo Lattice e d c f a b e f a d c b c e f a b a f e b c f a e d c b f a c b d e From left to right, the cases where (a, b, c, d, e, f ) = () (+, +, +, +, +, +), () (+,, +, +,, +), () (+,, +, 0,, +), () (+,, +, +,, ), () (+, +, +,, +, ) Sign determines direction of the sides. Magnitude determines length. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

22 Introducing Contours on the del Pezzo Lattice a b c d e f f f f f a a a a a b b b b b c c c c c d d d e e e e e f From left to right, the cases where (a, b, c, d, e, f ) = () (+, +, +, +, +, +), () (+,, +, +,, +), () (+,, +, 0,, +), () (+,, +, +,, ), () (+, +, +,, +, ) Sign determines direction of the sides. Magnitude determines length. e= a= b= c= d= e= f= a= c= d= f= a= c= f= d=0 e= - b= - e= - b= - a= b= - c= d=0 e= - f= - a= b= - c= d= e= - f= - a= b= c= d= - f= - Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

23 Introducing Contours on the del Pezzo Lattice () G(,,,,, ), () G(,,,,, ), () G(,,, 0,, ), () G(,,, 0,, ), () G(,,,,, ), () G(,,,,, ) e= a= b= c= d= e= f= a= c= d= f= a= c= f= d=0 e= - b= - e= - b= - a= b= - c= d=0 e= - f= - a= b= - c= d= e= - f= - a= b= c= d= - f= - Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 8 /

24 Turning a Contour C into the Subgraph G(C) ) Draw the contour C on top of the dp lattice starting from a degree white vertex. ) For all sides of positive length, we erase all the black vertices. ) For all sides of negative length, we erase all the white vertices. For sides of zero length (between two sides of positive length), we erase the white corner or keep it depending on convexity. ) After removing dangling edges and their incident faces, remaining subgraph inside contour is G(C). e.g. e=- d=+ f=0 a=+ c=- b=- Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 9 /

25 Turning a Contour C into the Subgraph G(C) ) Draw the contour C on top of the dp lattice starting from a degree white vertex. ) For all sides of positive length, we erase all the black vertices. ) For all sides of negative length, we erase all the white vertices. For sides of zero length (between two sides of positive length), we erase the white corner or keep it depending on convexity. ) After removing dangling edges and their incident faces, remaining subgraph inside contour is G(C). e.g. e=- d=+ f=0 a=+ c=- b=- e=- d=+ f=0 a=+ c=- b=- Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 9 /

26 Turning a Contour C into the Subgraph G(C) ) Draw the contour C on top of the dp lattice starting from a degree white vertex. ) For all sides of positive length, we erase all the black vertices. ) For all sides of negative length, we erase all the white vertices. For sides of zero length (between two sides of positive length), we erase the white corner or keep it depending on convexity. ) After removing dangling edges and their incident faces, remaining subgraph inside contour is G(C). e.g. e=- d=+ f=0 a=+ c=- b=- e=- d=+ f=0 a=+ c=- b=- f=0 e=- a=+ c=- b=- d=+ Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 9 /

27 Further Examples of Subgraphs G(C) from Contours C ) Draw the contour C on top of the dp lattice starting from a degree white vertex. ) For all sides of positive length, we erase all the black vertices. ) For all sides of negative length, we erase all the white vertices. For sides of zero length (between two sides of positive length), we erase the white corner or keep it depending on convexity. ) After removing dangling edges and their incident faces, remaining subgraph inside contour is G(C). a= b= c= d= e= f= a= c= d= f= a= c= f= d=0 e= - b= - e= - b= - Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

28 Aztec Dragons (Ciucu, Cottrell-Young, Propp) Revisited D n+/ = G(n +, n,, n +, n, 0). D n = G(n +, n,, n, n, 0). D / / / D D D D D a= b=0 c= - d= e= - f=0 a= b= - c= d= e= - f=0 a= b= - c= - d= e= - f=0 a= b= - c= d= e= - f=0 a= b= - c= - d= e= - f=0 a= b= - c= d= e= - f=0 Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

29 Aztec Castles (Leoni-M-Neel-Turner) Revisited NE-Aztec Castles γ j i = G(j, i j, i, j +, i j, i + ) SW-Aztec Castles γ j i = G( j +, i + j, i, j, i + j +, i ) e.g. γ = G(,,,,, ) and γ = G(,,,,, ). a= b= - c= d= e= - f= e= d= - c= - b= a= - f= - Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

30 Aztec Castles (Leoni-M-Neel-Turner) Revisited NE-Aztec Castles γ j i = G(j, i j, i, j +, i j, i + ) SW-Aztec Castles γ j i = G( j +, i + j, i, j, i + j +, i ) e.g. γ = G(,,,,, ) and γ = G(,,,,, ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

31 Turning Subgraphs into Laurent Polynomials G cm(g) x(m) = edge e M x i x j M = a perfect matching of G x(m), where (for edge e straddling faces i and j), cm(g) = the covering monomial of the graph G n (which records what face labels are contained in G and along its boundary). Remark: This is a reformulation of weighting schemes appearing in works such as Speyer ( Perfect Matchings and the Octahedron Recurrence ), Goncharov-Kenyon ( Dimers and cluster integrable systems ), and Di Francesco ( T-systems, networks and dimers ). Alternative definition of cm(g): We record all face labels inside contour and then divide by face labels straddling dangling edges. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

32 Initial cluster {x, x,..., x } in terms of contours Consider the following six special contours C = (0, 0,,,, 0), C = (,, 0, 0, 0, ), C = (0,,,, 0, 0), C = (, 0, 0, 0,, ), C = (,,, 0, 0, 0), C = (0, 0, 0,,, ). c=+ f=a=b=0 b=+ d=- e=+ c=d=e=0 f=+ a=- Applying our general algorithm, G(C i ) s correspond to graphs consisting of a single edge and a triangle of faces. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

33 Initial cluster {x, x,..., x } in terms of contours Consider the following six special contours C = (0, 0,,,, 0), C = (,, 0, 0, 0, ), C = (0,,,, 0, 0), C = (, 0, 0, 0,, ), C = (,,, 0, 0, 0), C = (0, 0, 0,,, ). c=+ f=a=b=0 b=+ d=- e=+ c=d=e=0 f=+ a=- Applying our general algorithm, G(C i ) s correspond to graphs consisting of a single edge and a triangle of faces. Using G cm(g) M = a perfect matching of G x(m), we see cm(g(c )) = x x x and x(m) = x x, hence G x x x x x = x Similar calculations show G(C i )) x i for i {,,..., }. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

34 Visualizing Contours as points in Z Consider the following six special contours C = (0, 0,,,, 0), C = (,, 0, 0, 0, ), C = (0,,,, 0, 0), C = (, 0, 0, 0,, ), C = (,,, 0, 0, 0), C = (0, 0, 0,,, ). Note that the six subgraphs corresponding to the initial contours are G(C ) = σγ 0, G(C ) = γ 0, G(C ) = σγ 0 0, G(C ) = γ 0, G(C ) = σγ 0, G(C ) = γ 0 0 using γ j i = G(j, i j, i, j +, i j, i + ) for i, j Z. σγ j i = G(j +, i j, i +, j, i j, i) for i, j Z. Remark: The operation σ appears to be 80 rotation. Better to think of it as σ(a, b, c, d, e, f ) = (a +, b, c +, d, e +, f ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

35 Visualizing Contours as points in Z G(C ) = σγ 0, G(C ) = γ 0, G(C ) = σγ 0 0, G(C ) = γ 0, G(C ) = σγ 0, G(C ) = γ 0 0 (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

36 Visualizing Contours as points in Z G(C ) = σγ 0, G(C ) = γ 0, G(C ) = σγ 0 0, G(C ) = γ 0, G(C ) = σγ 0, G(C ) = γ 0 0 (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) D n+/ = γ n+ = G(n +, n,, n +, n, 0). D n = σγ n 0 = G(n +, n,, n, n, 0). e.g. D n s and D n+/ correspond to vertical lines (0, n) and (, n + ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

37 Adding a Third Dimension About the same time the REU 0 students and I were investigating Aztec Castles, there was independent work of T. Lai on (unweighted) enumeration of tilings of Aztec Dragon Regions. New Aspects of Hexagonal Dungeons, arxiv:0.8, inspired by T. Lai s work on Blum s Conjecture with M. Ciucu (JCTA 0, arxiv:0.77) Unifying all these points of view, we define the contours σ k C j i = (j+k, i j k, i+k, j+ k, i j +k, i+ k) for (i, j, k) Z. Sign determines direction of the sides. Magnitude determines length. G(σ 0 C j i ) = γj i, G(σ C j i ) = σγj i, G(σ C j i+ ) = γ j i, G(σ0 C j i+ ) = σ γ j i. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 8 /

38 Triangles in 90 square lattice prisms in Z σ k C j i = (j+k, i j k, i+k, j+ k, i j +k, i+ k) for (i, j, k) Z. (i-,j) (i,j) (i-,j+) (i,j-) (i-,j) (i.j) (i-,j,k) (i-,j,k-) (i,j-,k) (i,j-,k-) (i,j,k) (i,j,k-) (i-,j,k) (i-,j,k-) (i-,j+,k) (i-,j+,k-) (i.j.k) (i.j.k-) {(0, ), (, 0), (0, 0)} [σγ 0, γ 0, γ0, σγ 0, σγ 0 0, γ 0 0] Thus {(0, ), (, 0), (0, 0)} [x, x,..., x ], the initial cluster. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 9 /

39 Introducing τ-mutation sequences Start with Model I of the dp quiver and the initial cluster {x, x,..., x }. Let τ = µ µ (), τ = µ µ (), and τ = µ µ (). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

40 Introducing τ-mutation sequences Start with Model I of the dp quiver and the initial cluster {x, x,..., x }. Let τ = µ µ (), τ = µ µ (), and τ = µ µ (). Each τ i mutates at a vertex of dp followed by mutation at its antipode. These mutations commute. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

41 Introducing τ-mutation sequences Start with Model I of the dp quiver and the initial cluster {x, x,..., x }. Let τ = µ µ (), τ = µ µ (), and τ = µ µ (). Each τ i mutates at a vertex of dp followed by mutation at its antipode. These mutations commute. Further on the level of clusters, (τ τ ) = (τ τ ) = (τ τ ) = (as discussed with P. Pylyavskyy) and there are no other relations. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

42 Introducing τ-mutation sequences Start with Model I of the dp quiver and the initial cluster {x, x,..., x }. Let τ = µ µ (), τ = µ µ (), and τ = µ µ (). Each τ i mutates at a vertex of dp followed by mutation at its antipode. These mutations commute. Further on the level of clusters, (τ τ ) = (τ τ ) = (τ τ ) = (as discussed with P. Pylyavskyy) and there are no other relations. Thus τ, τ, τ = Ã, considering the action of τ i s on clusters. Remark: The permutations are necessary here so that (τ i τ j ) does not reorder clusters as labeled seeds. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

43 Mutating Model I to Model II and back to Model I By applying τ = µ µ (), τ = µ µ (), or τ = µ µ (), we mutate the quiver: Claim: Corresponding action on triangular prisms: (i-,j,k) (i-,j,k-) (i,j-,k) (i,j-,k-) (i,j,k) (i,j,k-) (i-,j+,k) (i-,j,k) (i,j,k) (i-,j,k-) (i,j,k) (i,j,k-) (i-,j+,k) (i-,j+,k-) (i-,j,k) (i-,j,k-) (i.j.k) (i.j.k-) Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

44 Defining an action of τ, τ, and τ on Contours (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) ) Start at the initial triangle in the --90 Square Lattice. ) Given τ-mutation sequence S, take an alcove walk to the new triangle {(i, j ), (i, j ), (i, j )}, ordered so that i r j r r mod ) Define six-tuple of contouors C S = [C S, CS,..., CS ] by C S prism {(i, j, ), (i, j, 0), (i, j, 0), (i, j, ), (i, j, ), (i, j, 0)}. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

45 Defining an action of τ, τ, and τ on Contours (i-,j+) (i-,j+) (i,j+) (i-,j) (i,j) (i-,j) ) Start at {(0, ), (, 0), (0, 0)} in the --90 Square Lattice. ) Given τ-mutation sequence S, take an alcove walk to the new triangle {(i, j ), (i, j ), (i, j )}, ordered so that i r j r r mod ) Define six-tuple of contouors C S = [C S, CS,..., CS ] by C S prism {(i, j, ), (i, j, 0), (i, j, 0), (i, j, ), (i, j, ), (i, j, 0)}. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

46 Theorem [Lai-M 0+] Theorem (Reformulation of [Leoni-M-Neel-Turner 0]): Let Z S = [z, z,..., z ] be the cluster obtained after applying τ-mutation sequence S to the initial cluster {x, x,..., x }. Let w(g) = cm(g) M a perfect matching of G x(m). Let G(C i ) be the subgraph cut out by the contour C i. Then Z S = [w(g(c S ), w(g(cs ),..., w(g(cs )]. ) Start at {(0, ), (, 0), (0, 0)} in the --90 Square Lattice. ) Given τ-mutation sequence S, take an alcove walk to the new triangle {(i, j ), (i, j ), (i, j )}, ordered so that i r j r r mod ) Define six-tuple of contouors C S = [C S, CS,..., CS ] by C S prism {(i, j, ), (i, j, 0), (i, j, 0), (i, j, ), (i, j, ), (i, j, 0)}. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

47 Example : τ-mutation sequence τ τ τ (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) We start at the initial triangle {(0, ), (, 0), (0, 0)}. Applying the τ-mutation sequence τ, τ, τ corresponds to the alcove walk {(0, ), (, 0), (0, 0)} {(, ), (, 0), (0, 0)} {(, ), (0, ), (0, 0)} {(, ), (0, ), (, )} Recall that (i, j) (j, i j, i, j +, i j, i + ) and (j +, i j, i +, j, i j, i). C = (0, 0,,,, 0), C = (,, 0, 0, 0, ), C = (0,,,, 0, 0), C = (, 0, 0, 0,, ), C = (,,, 0, 0, 0), C = (0, 0, 0,,, ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

48 Example : τ-mutation sequence τ τ τ (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) We start at the initial triangle {(0, ), (, 0), (0, 0)}. Applying the τ-mutation sequence τ, τ, τ corresponds to the alcove walk {(0, ), (, 0), (0, 0)} {(, ), (, 0), (0, 0)} {(, ), (0, ), (0, 0)} {(, ), (0, ), (, )} Recall that (i, j) (j, i j, i, j +, i j, i + ) and (j +, i j, i +, j, i j, i). C = (,, 0,, 0, ), C = (, 0,,,, 0), C = (0,,,, 0, 0), C = (, 0, 0, 0,, ), C = (,,, 0, 0, 0), C = (0, 0, 0,,, ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

49 Example : τ-mutation sequence τ τ τ (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) We start at the initial triangle {(0, ), (, 0), (0, 0)}. Applying the τ-mutation sequence τ, τ, τ corresponds to the alcove walk {(0, ), (, 0), (0, 0)} {(, ), (, 0), (0, 0)} {(, ), (0, ), (0, 0)} {(, ), (0, ), (, )} Recall that (i, j) (j, i j, i, j +, i j, i + ) and (j +, i j, i +, j, i j, i). C = (,, 0,, 0, ), C = (, 0,,,, 0), C = (,, 0,,, ), C = (,,,,, 0), C = (,,, 0, 0, 0), C = (0, 0, 0,,, ). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

50 Example : τ-mutation sequence τ τ τ (-,) (-,) (0,) (,) τ (,) τ τ τ τ τ τ (-,0) (-,0) τ (0,0) τ (,0) (,0) τ τ τ (-,-) (-,-) (0,-) (,-) (,-) (-,-) (-,-) (0,-) (,-) (,-) We start at the initial triangle {(0, ), (, 0), (0, 0)}. Applying the τ-mutation sequence τ, τ, τ corresponds to the alcove walk {(0, ), (, 0), (0, 0)} {(, ), (, 0), (0, 0)} {(, ), (0, ), (0, 0)} {(, ), (0, ), (, )} Recall that (i, j) (j, i j, i, j +, i j, i + ) and (j +, i j, i +, j, i j, i). C = (,, 0,, 0, ), C = (, 0,,,, 0), C = (,, 0,,, ), C = (,,,,, 0), C = (,, 0,,, ), C = (,,,,, 0). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 8 /

51 Example : τ-mutation sequence τ τ τ = µ µ µ µ µ µ C = (,, 0,, 0, ), C = (, 0,,,, 0), C = (,, 0,,, ), C = (,,,,, 0), C = (,, 0,,, ), C = (,,,,, 0). x x +x x x x x +x x x x x x +x x x x +x x x x +x x x x x x x x x +x x x x +x x x x +x x x x x x (x x +x x )(x x +x x )(x x +x x ) x x x x x f=0 e= - a= b=0 c= - d= e= - f=0 a= d= c= b= - (x x +x x )(x x +x x )(x x +x x ) x x x x x Lai-M (IMA and Univ. Minnesota) D / The dp DQuiver: Aztec Castles and Beyond D / Et Tu Brutus 9 / e= - d= f=0 a= c= - b= -

52 Beyond Aztec Castles In previous work of T. Lai, he enumerated (without weights) the number of perfect matchings in certain graphs cut out by contours as above. We give a cluster algebraic interpretation of these formulas. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

53 Beyond Aztec Castles In previous work of T. Lai, he enumerated (without weights) the number of perfect matchings in certain graphs cut out by contours as above. We give a cluster algebraic interpretation of these formulas. Recall τ = µ µ (), τ = µ µ (), τ = µ µ () satisfy τ = τ = τ = and (τ iτ j ) = as actions on labeled clusters. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

54 Beyond Aztec Castles In previous work of T. Lai, he enumerated (without weights) the number of perfect matchings in certain graphs cut out by contours as above. We give a cluster algebraic interpretation of these formulas. Recall τ = µ µ (), τ = µ µ (), τ = µ µ () satisfy τ = τ = τ = and (τ iτ j ) = as actions on labeled clusters. We also consider τ = µ µ µ µ µ (), and τ = µ µ µ µ µ (). Note: unlike mutations in τ, τ, and τ, we do not have commutation here. However, the dp quiver is still sent back to itself after τ or τ. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

55 Action of τ and τ on Triangular Prisms (i-,j,k) (i-,j,k-) (i,j-,k) (i,j-,k-) (i-,j+,k) (i,j,k) (i-,j,k) (i,j,k-) (i,j,k) (i-,j,k-) (i,j,k) (i,j,k-) (i,j+,k) (i,j,k+) (i,j,k) (i,j,k) (i,j,k) (i,j,k ) (i,j,k) (i,j,k) (i,j,k+) (i,j,k) (i,j,k) (i,j,k ) (i,j,k+) (i,j,k+) (i,j,k) (i,j,k) (i,j,k) (i,j,k) (i,j,k+) (i,j,k) (i,j,k+) µ µ µ µ µ lifts layer (k ) to (k + ) and rotates the triangle by (). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus / (i,j,k) (i,j,k+) (i,j,k)

56 Action of τ and τ on Clusters Recall τ = µ µ (), τ = µ µ (), τ = µ µ () satisfy τ = τ = τ = and (τ iτ j ) = as actions on labeled clusters. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

57 Action of τ and τ on Clusters Recall τ = µ µ (), τ = µ µ (), τ = µ µ () satisfy τ = τ = τ = and (τ iτ j ) = as actions on labeled clusters. We also consider τ = µ µ µ µ µ (), and τ = µ µ µ µ µ (). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

58 Action of τ and τ on Clusters Recall τ = µ µ (), τ = µ µ (), τ = µ µ () satisfy τ = τ = τ = and (τ iτ j ) = as actions on labeled clusters. We also consider τ = µ µ µ µ µ (), and τ = µ µ µ µ µ (). We then get the relations τ = τ =, and τ i and τ j commute for i {,, } and j {, }. However, (τ τ ) has infinite order. In summary, we have a book of affine A lattices where we apply τ and τ in an alternating fashion to get between pages. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

59 Putting it all together Because of the commutation relations, to get clusters obtained from {x, x,..., x } by applying sequences S of τ, τ,..., τ, sufficient to let S = S S where S is a τ-mutation sequence (as earlier) and S = τ τ τ... τ, τ τ τ... τ, τ τ τ... τ, or τ τ τ... τ. Let [(i, j ), (i, j ), (i, j )] denote the triangle reached after applying the alcove walk associated to S starting from the initial triangle. C S = C S S [(i, j, k ), (i, j, k ), (i, j, k ), (i, j, k ), (i, j, k ), (i, j, k )] in Z where {k, k } = { S, S + } (resp. { S, S + }) if S starts with τ (resp. τ ). (i.e. τ τ pushes down, τ τ pushes up) Further, we let k = ± S if S is odd and k = ± S otherwise. (i, j, k) σ k C j i = (j +k, i j k, i +k, j + k, i j +k, i + k). Then C S is defined as [σ k C j i, σ k C j i, σ k C j i, σ k C j i, σ k C j i, σ k C j i ]. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

60 Putting it all together Let S = S S and S({x, x,..., x }) = {z (S), z (S),..., z (S) }. Let C S = (C, C,..., C ) be the six-tuple of contours obtained as above. Theorem (Lai-M 0+) : As long as the contours C S = (C, C,..., C ) are (without self-intersections), then the resulting Laurent expansions of the cluster variables Z S = {z (S), z (S),..., z (S) } given by Z S = [w(g(c ), w(g(c ),..., w(g(c )]. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

61 Putting it all together Let S = S S and S({x, x,..., x }) = {z (S), z (S),..., z (S) }. Let C S = (C, C,..., C ) be the six-tuple of contours obtained as above. Theorem (Lai-M 0+) : As long as the contours C S = (C, C,..., C ) are (without self-intersections), then the resulting Laurent expansions of the cluster variables Z S = {z (S), z (S),..., z (S) } given by Z S = [w(g(c ), w(g(c ),..., w(g(c )]. Proof (Method): Kuo s Method of Graphical Condensation for Counting Perfect Matchings. We isolate four vertices {a, b, c, d} (in cyclic order and alternating color) near the boundary of the contour and argue that w(g)w(g {a, b, c, d}) = w(g {a, b})w(g {c, d})+w(g {a, d})w(g {b, c}) corresponds to the cluster mutation and translations in the contours. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

62 Putting it all together Let S = S S and S({x, x,..., x }) = {z (S), z (S),..., z (S) }. Let C S = (C, C,..., C ) be the six-tuple of contours obtained as above. Theorem (Lai-M 0+) : As long as the contours C S = (C, C,..., C ) are (without self-intersections), then the resulting Laurent expansions of the cluster variables Z S = {z (S), z (S),..., z (S) } given by Z S = [w(g(c ), w(g(c ),..., w(g(c )]. Proof (Method): Kuo s Method of Graphical Condensation for Counting Perfect Matchings. We isolate four vertices {a, b, c, d} (in cyclic order and alternating color) near the boundary of the contour and argue that w(g)w(g {a, b, c, d}) = w(g {a, b})w(g {c, d})+w(g {a, d})w(g {b, c}) corresponds to the cluster mutation and translations in the contours. Remark: As side lengths change and contour goes from convex to concave or vice-versa, we have to use different types of Kuo Condensations (Balanced, Unbalanced, Non-alternating). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

63 Example : S = τ τ τ τ τ τ τ τ τ We reach {(, ), (, ), (0, )} and applying τ yields C S = [σ C, C, C, σ C, σ C 0, C 0 ] = [(,, 0,,, ), (,,,,, ), (,,,,, ), (,, 0,,, ), (,,,,, ), (,, 0,,, )]. c= d= e= - f= a= b= - c= d= e= - f= a= b= - c=0 d= e= - f= a= c= - b= - d= e= - f= a= b= - c=0 d= e= - f= b=- a= f= e= - d= c=0 b= - a= Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

64 Example : S = τ τ τ τ τ τ τ τ τ [(0,,,,, ), (,, 0,,, ), (0,,,,, ), (,, 0,,, ), (0,, 0,,, ), (, 0,,,, )]. f= e= - d= c= - b= - a=0 f= e= - d= c=0 b= - a= - f= e= - d= c= b= - a=0 Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

65 Example : S = τ τ τ τ τ τ τ τ τ [(0,,,,, ), (,, 0,,, ), (0,,,,, ), (,, 0,,, ), (0,, 0,,, ), (, 0,,,, )]. f= e= - d= c=0 b= - a=0 f= e= - d= c=0 b= - a= a=- f= b=0 c= - d= e= - Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 7 /

66 Example of Kuo Condensations Used in Proof (Balanced) A B C D A B C D A B C D A D B C Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 8 /

67 Example of Kuo Condensations Used in Proof (Balanced) A B C D A B C D A B C D A D B C Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 9 /

68 Example of Kuo Condensations Used (Unbalanced) D B A C B D A B D C A C Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus 0 /

69 Example of Kuo Condensations Used (Non-alternating) A B C D C B A D B C B D A D C B A Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

70 Future Directions We now understand many sequences inside three-dimensional subspace of toric mutations (at vertices with in-coming arrows, out-going arrows) for the dp Quiver. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

71 Future Directions We now understand many sequences inside three-dimensional subspace of toric mutations (at vertices with in-coming arrows, out-going arrows) for the dp Quiver. Question : We only understand when contours have no self-intersections. (Corresponds to the length of S being longer enough than S.) Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

72 Future Directions We now understand many sequences inside three-dimensional subspace of toric mutations (at vertices with in-coming arrows, out-going arrows) for the dp Quiver. Question : We only understand when contours have no self-intersections. (Corresponds to the length of S being longer enough than S.) How can we extend our combinatorial interpretation to cases with self-intersections? Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

73 Future Directions We now understand many sequences inside three-dimensional subspace of toric mutations (at vertices with in-coming arrows, out-going arrows) for the dp Quiver. Question : We only understand when contours have no self-intersections. (Corresponds to the length of S being longer enough than S.) How can we extend our combinatorial interpretation to cases with self-intersections? Questions : How can this new point of view (via contours) for the dp quiver better our understanding of Gale-Robinson, Octahedron Recurrence, and other cases of toric mutations? Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

74 Future Directions We now understand many sequences inside three-dimensional subspace of toric mutations (at vertices with in-coming arrows, out-going arrows) for the dp Quiver. Question : We only understand when contours have no self-intersections. (Corresponds to the length of S being longer enough than S.) How can we extend our combinatorial interpretation to cases with self-intersections? Questions : How can this new point of view (via contours) for the dp quiver better our understanding of Gale-Robinson, Octahedron Recurrence, and other cases of toric mutations? Concentrating still on the dp quiver, there are more toric mutation sequences, but also more relations. Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

75 Future Directions Concentrating still on the dp quiver, there are more toric mutation sequences, but also more relations. Example: µ µ µ µ µ actually sends labeled cluster back to itself (except with permutation ()). Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

76 Future Directions Concentrating still on the dp quiver, there are more toric mutation sequences, but also more relations. Example: µ µ µ µ µ actually sends labeled cluster back to itself (except with permutation ()). Question : Accounting for these relations and others, what is left in the space of toric mutation sequences (for this example)? Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

77 Future Directions Concentrating still on the dp quiver, there are more toric mutation sequences, but also more relations. Example: µ µ µ µ µ actually sends labeled cluster back to itself (except with permutation ()). Question : Accounting for these relations and others, what is left in the space of toric mutation sequences (for this example)? Question : Do τ, τ,..., τ represent integrable directions of mutation sequences? What about the compositions τ τ τ τ τ τ, τ τ τ τ, τ τ? Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

78 Thank You For Listening Aztec Castles and the dp Quiver (with Megan Leoni, Seth Neel, and Paxton Turner, Journal of Physics A: Math. Theor. 7 70, arxiv:08.9 In-Jee Jeong, Bipartite Graphs, Quivers, and Cluster Variables, REU Report, reiner/reu/jeong0.pdf Sicong Zhang, Cluster Variables and Perfect Matchings of Subgraphs of the dp Lattice, REU Report, reiner/reu/zhang0.pdf Gale-Robinson Sequences and Brane Tilings (with In-Jee Jeong and and Sicong Zhang), Discrete Mathematics and Theoretical Computer Science Proc. AS (0), (Longer version in preparation.) Tri Lai, New Aspects of Hexagonal Dungeons, arxiv:0.8 Tri Lai, New regions whose tilings are enumerated by powers of and, preprint, tmlai/newdungeon.pdf http//math.umn.edu/ musiker/beyond.pdf Lai-M (IMA and Univ. Minnesota) The dp Quiver: Aztec Castles and Beyond Et Tu Brutus /

Combinatorics of the Del-Pezzo 3 Quiver: Aztec Dragons, Castles, and Beyond

Combinatorics of the Del-Pezzo 3 Quiver: Aztec Dragons, Castles, and Beyond Combinatorics of the Del-Pezzo Quiver: Aztec Dragons, Castles, and Beyond Gregg Musiker (U. Minnesota) Conference on Cluster Algebras in Combinatorics and Topology, KIAS December, 0 http//math.umn.edu/

More information

Brane Tilings and Cluster Algebras

Brane Tilings and Cluster Algebras Brane Tilings and Cluster Algebras Gregg Musiker (U. Minnesota), In-Jee Jeong (Brown Univ.), and Sicong Zhang (Columbia Univ.) Algebra, Geometry and Combinatorics Day Loyola University Chicago November

More information

Cluster Variables and Perfect Matchings of Subgraphs of the dp 3 Lattice

Cluster Variables and Perfect Matchings of Subgraphs of the dp 3 Lattice Cluster Variables and Perfect Matchings of Subgraphs of the dp Lattice Sicong Zhang October 8, 0 Abstract We give a combinatorial intepretation of cluster variables of a specific cluster algebra under

More information

Colored BPS Pyramid Partition Functions, Quivers and Cluster. and Cluster Transformations

Colored BPS Pyramid Partition Functions, Quivers and Cluster. and Cluster Transformations Colored BPS Pyramid Partition Functions, Quivers and Cluster Transformations Richard Eager IPMU Based on: arxiv:. Tuesday, January 4, 0 Introduction to AdS/CFT Quivers, Brane Tilings, and Geometry Pyramids

More information

STABLE CLUSTER VARIABLES

STABLE CLUSTER VARIABLES STABLE CLUSTER VARIABLES GRACE ZHANG Abstract. Eager and Franco introduced a transformation on the F-polynomials of Fomin and Zelevinsky that seems to display a surprising stabilization property in the

More information

The Greedy Basis Equals the Theta Basis A Rank Two Haiku

The Greedy Basis Equals the Theta Basis A Rank Two Haiku The Greedy Basis Equals the Theta Basis A Rank Two Haiku Man Wai Cheung (UCSD), Mark Gross (Cambridge), Greg Muller (Michigan), Gregg Musiker (University of Minnesota) *, Dylan Rupel (Notre Dame), Salvatore

More information

Tiling expression of minors

Tiling expression of minors Institute for Mathematics and its Applications Minneapolis, MN Colloquium University of British Columbia, Vancourver February, 0 Outline Introduction to the Enumeration of Tilings. Electrical networks

More information

Bases for Cluster Algebras from Surfaces

Bases for Cluster Algebras from Surfaces Bases for Cluster Algebras from Surfaces Gregg Musiker (U. Minnesota), Ralf Schiffler (U. Conn.), and Lauren Williams (UC Berkeley) Bay Area Discrete Math Day Saint Mary s College of California November

More information

arxiv: v1 [math.co] 20 Dec 2016

arxiv: v1 [math.co] 20 Dec 2016 F-POLYNOMIAL FORMULA FROM CONTINUED FRACTIONS MICHELLE RABIDEAU arxiv:1612.06845v1 [math.co] 20 Dec 2016 Abstract. For cluster algebras from surfaces, there is a known formula for cluster variables and

More information

Quivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014

Quivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014 Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then

More information

Quiver mutations. Tensor diagrams and cluster algebras

Quiver mutations. Tensor diagrams and cluster algebras Maurice Auslander Distinguished Lectures April 20-21, 2013 Sergey Fomin (University of Michigan) Quiver mutations based on joint work with Andrei Zelevinsky Tensor diagrams and cluster algebras based on

More information

Weak Separation, Pure Domains and Cluster Distance

Weak Separation, Pure Domains and Cluster Distance Discrete Mathematics and Theoretical Computer Science DMTCS vol (subm, by the authors, 1 1 Weak Separation, Pure Domains and Cluster Distance Miriam Farber 1 and Pavel Galashin 1 1 Department of Mathematics,

More information

2-FRIEZE PATTERNS AND THE CLUSTER STRUCTURE OF THE SPACE OF POLYGONS

2-FRIEZE PATTERNS AND THE CLUSTER STRUCTURE OF THE SPACE OF POLYGONS -FRIEZE PATTERNS AND THE CLUSTER STRUCTURE OF THE SPACE OF POLYGONS SOPHIE MORIER-GENOUD, VALENTIN OVSIENKO, AND SERGE TABACHNIKOV Abstract We study the space of -frieze patterns generalizing that of the

More information

THE MASTER SPACE OF N=1 GAUGE THEORIES

THE MASTER SPACE OF N=1 GAUGE THEORIES THE MASTER SPACE OF N=1 GAUGE THEORIES Alberto Zaffaroni CAQCD 2008 Butti, Forcella, Zaffaroni hepth/0611229 Forcella, Hanany, Zaffaroni hepth/0701236 Butti,Forcella,Hanany,Vegh, Zaffaroni, arxiv 0705.2771

More information

NOTES ON THE TOTALLY NONNEGATIVE GRASSMANNIAN

NOTES ON THE TOTALLY NONNEGATIVE GRASSMANNIAN NOTES ON THE TOTALLY NONNEGATIVE GRASSMANNIAN THOMAS LAM 1. Introductory comments The theory of the totally nonnegative part of the Grassmannian was introduced by Postnikov around a decade ago. The subject

More information

Cluster varieties for tree-shaped quivers and their cohomology

Cluster varieties for tree-shaped quivers and their cohomology Cluster varieties for tree-shaped quivers and their cohomology Frédéric Chapoton CNRS & Université de Strasbourg Octobre 2016 Cluster algebras and the associated varieties Cluster algebras are commutative

More information

Combinatorics of Theta Bases of Cluster Algebras

Combinatorics of Theta Bases of Cluster Algebras Combinatorics of Theta Bases of Cluster Algebras Li Li (Oakland U), joint with Kyungyong Lee (University of Nebraska Lincoln/KIAS) and Ba Nguyen (Wayne State U) Jan 22 24, 2016 What is a Cluster Algebra?

More information

Dimer Problems. Richard Kenyon. August 29, 2005

Dimer Problems. Richard Kenyon. August 29, 2005 Dimer Problems. Richard Kenyon August 29, 25 Abstract The dimer model is a statistical mechanical model on a graph, where configurations consist of perfect matchings of the vertices. For planar graphs,

More information

Cluster algebras, snake graphs and continued fractions. Ralf Schiffler

Cluster algebras, snake graphs and continued fractions. Ralf Schiffler Cluster algebras, snake graphs and continued fractions Ralf Schiffler Intro Cluster algebras Continued fractions Snake graphs Intro Cluster algebras Continued fractions expansion formula via perfect matchings

More information

A Simple Proof of the Aztec Diamond Theorem

A Simple Proof of the Aztec Diamond Theorem A Simple Proof of the Aztec Diamond Theorem Sen-Peng Eu Department of Applied Mathematics National University of Kaohsiung Kaohsiung 811, Taiwan, ROC speu@nuk.edu.tw Tung-Shan Fu Mathematics Faculty National

More information

MONOMER CORRELATIONS ON THE SQUARE LATTICE. Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 47405, USA

MONOMER CORRELATIONS ON THE SQUARE LATTICE. Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 47405, USA MONOMER CORRELATIONS ON THE SQUARE LATTICE Mihai Ciucu Indiana University Department of Mathematics, Bloomington, IN 4745, USA Domino tilings Domino tilings are equivalent to perfect matchings. M(G) :=

More information

ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS

ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,

More information

Statistical Mechanics and Combinatorics : Lecture IV

Statistical Mechanics and Combinatorics : Lecture IV Statistical Mechanics and Combinatorics : Lecture IV Dimer Model Local Statistics We ve already discussed the partition function Z for dimer coverings in a graph G which can be computed by Kasteleyn matrix

More information

Problem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions.

Problem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions. 18.217 Problem Set (due Monday, December 03, 2018) Solve as many problems as you want. Turn in your favorite solutions. You can also solve and turn any other claims that were given in class without proofs,

More information

Difference Painlevé equations from 5D gauge theories

Difference Painlevé equations from 5D gauge theories Difference Painlevé equations from 5D gauge theories M. Bershtein based on joint paper with P. Gavrylenko and A. Marshakov arxiv:.006, to appear in JHEP February 08 M. Bershtein Difference Painlevé based

More information

integrable systems in the dimer model R. Kenyon (Brown) A. Goncharov (Yale)

integrable systems in the dimer model R. Kenyon (Brown) A. Goncharov (Yale) integrable systems in the dimer model R. Kenyon (Brown) A. Goncharov (Yale) 1. Convex integer polygon triple crossing diagram 2. Minimal bipartite graph on T 2 line bundles 3. Cluster integrable system.

More information

arxiv: v2 [hep-th] 4 Jun 2016

arxiv: v2 [hep-th] 4 Jun 2016 Prepared for submission to JHEP CCNY-HEP-15-08 Exact quantization conditions for cluster integrable systems arxiv:1512.03061v2 [hep-th] 4 Jun 2016 Sebastián Franco, a,b Yasuyuki Hatsuda c and Marcos Mariño

More information

ACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms

ACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms 1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex

More information

ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS

ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS MANJIL P. SAIKIA Abstract. In this paper we enumerate domino tilings of an Aztec rectangle with arbitrary defects of size one on

More information

arxiv: v2 [math.pr] 26 Aug 2017

arxiv: v2 [math.pr] 26 Aug 2017 CONSTRAINED PERCOLATION, ISING MODEL AND XOR ISING MODEL ON PLANAR LATTICES ZHONGYANG LI arxiv:1707.04183v2 [math.pr] 26 Aug 2017 Abstract. We study constrained percolation models on planar lattices including

More information

Bipartite Field Theories: from D-Brane Probes to Scattering Amplitudes

Bipartite Field Theories: from D-Brane Probes to Scattering Amplitudes Preprint typeset in JHEP style. - HYPER VERSION SLAC-PUB-15127 IPPP/12/47 DCPT/12/94 Bipartite Field Theories: from D-Brane Probes to Scattering Amplitudes Sebastián Franco 1,2 1 Theory Group, SLAC National

More information

PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM

PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom

More information

Contents. Counting Methods and Induction

Contents. Counting Methods and Induction Contents Counting Methods and Induction Lesson 1 Counting Strategies Investigations 1 Careful Counting... 555 Order and Repetition I... 56 3 Order and Repetition II... 569 On Your Own... 573 Lesson Counting

More information

WEAK SEPARATION, PURE DOMAINS AND CLUSTER DISTANCE

WEAK SEPARATION, PURE DOMAINS AND CLUSTER DISTANCE WEAK SEPARATION, PURE DOMAINS AND CLUSTER DISTANCE MIRIAM FARBER AND PAVEL GALASHIN Abstract. Following the proof of the purity conjecture for weakly separated collections, recent years have revealed a

More information

A reciprocity theorem for domino tilings

A reciprocity theorem for domino tilings A reciprocity theorem for domino tilings James Propp Department of Mathematics University of Wisconsin Madison, Wisconsin, USA propp@math.wisc.edu Submitted: April 1, 2001; Accepted: April 30, 2001 MR

More information

The Arctic Circle re-revisited

The Arctic Circle re-revisited `Workshop on Combinatorial Physics' Cardiff, 17-19 December 2013 The Arctic Circle re-revisited Filippo Colomo INFN, Firenze Joint work with: Andrei Pronko (PDMI-Steklov, Saint-Petersbourg) Domino tiling

More information

SOPHIE MORIER-GENOUD, VALENTIN OVSIENKO AND SERGE TABACHNIKOV

SOPHIE MORIER-GENOUD, VALENTIN OVSIENKO AND SERGE TABACHNIKOV SL (Z)-TILINGS OF THE TORUS, COXETER-CONWAY FRIEZES AND FAREY TRIANGULATIONS SOPHIE MORIER-GENOUD, VALENTIN OVSIENKO AND SERGE TABACHNIKOV Abstract The notion of SL -tiling is a generalization of that

More information

COUNTING BPS STATES IN CONFORMAL GAUGE THEORIES

COUNTING BPS STATES IN CONFORMAL GAUGE THEORIES COUNTING BPS STATES IN CONFORMAL GAUGE THEORIES Alberto Zaffaroni PISA, MiniWorkshop 2007 Butti, Forcella, Zaffaroni hepth/0611229 Forcella, Hanany, Zaffaroni hepth/0701236 Butti,Forcella,Hanany,Vegh,

More information

CLUSTER EXPANSION FORMULAS AND PERFECT MATCHINGS

CLUSTER EXPANSION FORMULAS AND PERFECT MATCHINGS CLUSTER EXPANSION FORMULAS AND PERFECT MATCHINGS GREGG MUSIKER AND RALF SCHIFFLER Abstract. We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We

More information

BOUNDS ON THE NUMBER OF REAL SOLUTIONS TO POLYNOMIAL EQUATIONS

BOUNDS ON THE NUMBER OF REAL SOLUTIONS TO POLYNOMIAL EQUATIONS 2 October 2007 arxiv:0706.375 BOUNDS ON THE NUMBER OF REAL SOLUTIONS TO POLYNOMIAL EQUATIONS DANIEL J. BATES, FRÉDÉRIC BIHAN, AND FRANK SOTTILE Abstract. We use Gale duality for complete intersections

More information

Zhegalkin Zebra Motives

Zhegalkin Zebra Motives arxiv:1805.09627v1 [math.ag] 24 May 2018 Zhegalkin Zebra Motives digital recordings of Mirror Symmetry Jan Stienstra Abstract Zhegalkin Zebra Motives are tilings of the plane by black and white polygons

More information

Free fermion and wall-crossing

Free fermion and wall-crossing Free fermion and wall-crossing Jie Yang School of Mathematical Sciences, Capital Normal University yangjie@cnu.edu.cn March 4, 202 Motivation For string theorists It is called BPS states counting which

More information

Acyclic Digraphs arising from Complete Intersections

Acyclic Digraphs arising from Complete Intersections Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 14, 017 Total Positivity The final and historically the original motivation is from the study of total positive matrices, which

More information

The Geometry of Root Systems. Brian C. Hall

The Geometry of Root Systems. Brian C. Hall The Geometry of Root Systems A E Z S Brian C. Hall T G R S T G R S 1 1. I Root systems arise in the theory of Lie groups and Lie algebras, but can also be studied as mathematical objects in their own right.

More information

Symbiosis and Reciprocity. a talk in honor of Richard A. Brualdi, RAB. April 30, 2005

Symbiosis and Reciprocity. a talk in honor of Richard A. Brualdi, RAB. April 30, 2005 Symbiosis and Reciprocity a talk in honor of Richard A. Brualdi, RAB April 30, 2005 Jim Propp Department of Mathematics University of Wisconsin - Madison slides on web at www.math.wisc.edu/ propp/brualdi.pdf

More information

The geometry of cluster algebras

The geometry of cluster algebras The geometry of cluster algebras Greg Muller February 17, 2013 Cluster algebras (the idea) A cluster algebra is a commutative ring generated by distinguished elements called cluster variables. The set

More information

Brane Tilings: NSVZ Beta Function

Brane Tilings: NSVZ Beta Function Brane Tilings: NSVZ Beta Function Amihay Hanany Imperial College & KITP UCSB 1 NSVZ Beta Function 2 NSVZ Beta Function β 1 g 2 = 1 8π 2 3N M µ[r M ](1 γ M (g)) 1 g 2 N/8π 2 2 NSVZ Beta Function β 1 g 2

More information

AdS/CFT in String Theory and M-Theory

AdS/CFT in String Theory and M-Theory AdS/CFT in String Theory and M-Theory Daniel R. Gulotta A Dissertation Presented to the Faculty of Princeton University in Candidacy for the Degree of Doctor of Philosophy Recommended for Acceptance by

More information

A NEW COMBINATORIAL FORMULA FOR CLUSTER MONOMIALS OF EQUIORIENTED TYPE A QUIVERS

A NEW COMBINATORIAL FORMULA FOR CLUSTER MONOMIALS OF EQUIORIENTED TYPE A QUIVERS A NEW COMBINATORIAL FORMULA FOR CLUSTER MONOMIALS OF EQUIORIENTED TYPE A QUIVERS D. E. BAYLERAN, DARREN J. FINNIGAN, ALAA HAJ ALI, KYUNGYONG LEE, CHRIS M. LOCRICCHIO, MATTHEW R. MILLS, DANIEL PUIG-PEY

More information

CONSTRAINED PERCOLATION ON Z 2

CONSTRAINED PERCOLATION ON Z 2 CONSTRAINED PERCOLATION ON Z 2 ZHONGYANG LI Abstract. We study a constrained percolation process on Z 2, and prove the almost sure nonexistence of infinite clusters and contours for a large class of probability

More information

BMT 2014 Symmetry Groups of Regular Polyhedra 22 March 2014

BMT 2014 Symmetry Groups of Regular Polyhedra 22 March 2014 Time Limit: 60 mins. Maximum Score: 125 points. Instructions: 1. When a problem asks you to compute or list something, no proof is necessary. However, for all other problems, unless otherwise indicated,

More information

Algebraically defined graphs and generalized quadrangles

Algebraically defined graphs and generalized quadrangles Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number

More information

CLUSTER ALGEBRA ALFREDO NÁJERA CHÁVEZ

CLUSTER ALGEBRA ALFREDO NÁJERA CHÁVEZ Séminaire Lotharingien de Combinatoire 69 (203), Article B69d ON THE c-vectors AND g-vectors OF THE MARKOV CLUSTER ALGEBRA ALFREDO NÁJERA CHÁVEZ Abstract. We describe the c-vectors and g-vectors of the

More information

DOMINO TILING. Contents 1. Introduction 1 2. Rectangular Grids 2 Acknowledgments 10 References 10

DOMINO TILING. Contents 1. Introduction 1 2. Rectangular Grids 2 Acknowledgments 10 References 10 DOMINO TILING KASPER BORYS Abstract In this paper we explore the problem of domino tiling: tessellating a region with x2 rectangular dominoes First we address the question of existence for domino tilings

More information

POSITIVITY FOR CLUSTER ALGEBRAS FROM SURFACES

POSITIVITY FOR CLUSTER ALGEBRAS FROM SURFACES POSITIVITY FOR CLUSTER ALGEBRAS FROM SURFACES GREGG MUSIKER, RALF SCHIFFLER, AND LAUREN WILLIAMS Abstract We give combinatorial formulas for the Laurent expansion of any cluster variable in any cluster

More information

Math 396. Quotient spaces

Math 396. Quotient spaces Math 396. Quotient spaces. Definition Let F be a field, V a vector space over F and W V a subspace of V. For v, v V, we say that v v mod W if and only if v v W. One can readily verify that with this definition

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: July 11, 2017 11 Cluster Algebra from Surfaces In this lecture, we will define and give a quick overview of some properties of cluster

More information

A SURVEY OF CLUSTER ALGEBRAS

A SURVEY OF CLUSTER ALGEBRAS A SURVEY OF CLUSTER ALGEBRAS MELODY CHAN Abstract. This is a concise expository survey of cluster algebras, introduced by S. Fomin and A. Zelevinsky in their four-part series of foundational papers [1],

More information

Combinatorics and geometry of E 7

Combinatorics and geometry of E 7 Combinatorics and geometry of E 7 Steven Sam University of California, Berkeley September 19, 2012 1/24 Outline Macdonald representations Vinberg representations Root system Weyl group 7 points in P 2

More information

arxiv: v1 [math.co] 19 Aug 2016

arxiv: v1 [math.co] 19 Aug 2016 THE EXCHANGE GRAPHS OF WEAKLY SEPARATED COLLECTIONS MEENA JAGADEESAN arxiv:1608.05723v1 [math.co] 19 Aug 2016 Abstract. Weakly separated collections arise in the cluster algebra derived from the Plücker

More information

Advanced Combinatorial Optimization September 22, Lecture 4

Advanced Combinatorial Optimization September 22, Lecture 4 8.48 Advanced Combinatorial Optimization September 22, 2009 Lecturer: Michel X. Goemans Lecture 4 Scribe: Yufei Zhao In this lecture, we discuss some results on edge coloring and also introduce the notion

More information

Transversal and cotransversal matroids via their representations.

Transversal and cotransversal matroids via their representations. Transversal and cotransversal matroids via their representations. Federico Ardila Submitted: May, 006; Accepted: Feb. 7, 007 Mathematics Subject Classification: 05B5; 05C8; 05A99 Abstract. It is known

More information

Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer

Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer Let A be a cluster algebra with B-matrix B. Let X be Spec A with all of the cluster variables inverted, and embed X into a torus by

More information

Parity Dominating Sets in Grid Graphs

Parity Dominating Sets in Grid Graphs Parity Dominating Sets in Grid Graphs John L. Goldwasser and William F. Klostermeyer Dept. of Mathematics West Virginia University Morgantown, WV 26506 Dept. of Computer and Information Sciences University

More information

5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n

5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n 5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n d) variables, which are called Plücker coordinates: C[p]

More information

Again we return to a row of 1 s! Furthermore, all the entries are positive integers.

Again we return to a row of 1 s! Furthermore, all the entries are positive integers. Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 4, 207 Examples. Conway-Coxeter frieze pattern Frieze is the wide central section part of an entablature, often seen in Greek temples,

More information

Lecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem.

Lecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem. Lecture J jacques@ucsd.edu Notation: Let [n] [n] := [n] 2. A weighted digraph is a function W : [n] 2 R. An arborescence is, loosely speaking, a digraph which consists in orienting eery edge of a rooted

More information

Dissimilarity maps on trees and the representation theory of GL n (C)

Dissimilarity maps on trees and the representation theory of GL n (C) Dissimilarity maps on trees and the representation theory of GL n (C) Christopher Manon Department of Mathematics University of California, Berkeley Berkeley, California, U.S.A. chris.manon@math.berkeley.edu

More information

KRONECKER POWERS CHARACTER POLYNOMIALS. A. Goupil, with C. Chauve and A. Garsia,

KRONECKER POWERS CHARACTER POLYNOMIALS. A. Goupil, with C. Chauve and A. Garsia, KRONECKER POWERS AND CHARACTER POLYNOMIALS A. Goupil, with C. Chauve and A. Garsia, Menu Introduction : Kronecker products Tensor powers Character Polynomials Perspective : Duality with product of conjugacy

More information

Combinatorics for algebraic geometers

Combinatorics for algebraic geometers Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is

More information

FLORIDA STANDARDS TO BOOK CORRELATION FOR GRADE 7 ADVANCED

FLORIDA STANDARDS TO BOOK CORRELATION FOR GRADE 7 ADVANCED FLORIDA STANDARDS TO BOOK CORRELATION FOR GRADE 7 ADVANCED After a standard is introduced, it is revisited many times in subsequent activities, lessons, and exercises. Domain: The Number System 8.NS.1.1

More information

Mutations of non-integer quivers: finite mutation type. Anna Felikson

Mutations of non-integer quivers: finite mutation type. Anna Felikson Mutations of non-integer quivers: finite mutation type Anna Felikson Durham University (joint works with Pavel Tumarkin and Philipp Lampe) Jerusalem, December 0, 08 . Mutations of non-integer quivers:

More information

Linear algebra and applications to graphs Part 1

Linear algebra and applications to graphs Part 1 Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces

More information

Introduction to cluster algebras. Andrei Zelevinsky (Northeastern University) MSRI/Evans Lecture, UC Berkeley, October 1, 2012

Introduction to cluster algebras. Andrei Zelevinsky (Northeastern University) MSRI/Evans Lecture, UC Berkeley, October 1, 2012 Introduction to cluster algebras Andrei Zelevinsky (Northeastern University) MSRI/Evans Lecture, UC Berkeley, October, 202 http://www.math.neu.edu/zelevinsky/msri-evans-2.pdf Cluster algebras Discovered

More information

Determinant density and the Vol-Det Conjecture

Determinant density and the Vol-Det Conjecture Determinant density and the Vol-Det Conjecture Ilya Kofman College of Staten Island and The Graduate Center City University of New York (CUNY) Joint work with Abhijit Champanerkar and Jessica Purcell December

More information

Stringy Instantons, Backreaction and Dimers.

Stringy Instantons, Backreaction and Dimers. Stringy Instantons, Backreaction and Dimers. Eduardo García-Valdecasas Tenreiro Instituto de Física Teórica UAM/CSIC, Madrid Based on 1605.08092 and 1704.05888 by E.G. & A. Uranga and ongoing work String

More information

ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS

ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS ACYCLIC DIGRAPHS GIVING RISE TO COMPLETE INTERSECTIONS WALTER D. MORRIS, JR. ABSTRACT. We call a directed acyclic graph a CIdigraph if a certain affine semigroup ring defined by it is a complete intersection.

More information

Knots and Mirror Symmetry. Mina Aganagic UC Berkeley

Knots and Mirror Symmetry. Mina Aganagic UC Berkeley Knots and Mirror Symmetry Mina Aganagic UC Berkeley 1 Quantum physics has played a central role in answering the basic question in knot theory: When are two knots distinct? 2 Witten explained in 88, that

More information

1 Counting spanning trees: A determinantal formula

1 Counting spanning trees: A determinantal formula Math 374 Matrix Tree Theorem Counting spanning trees: A determinantal formula Recall that a spanning tree of a graph G is a subgraph T so that T is a tree and V (G) = V (T ) Question How many distinct

More information

MOTIVES ASSOCIATED TO SUMS OF GRAPHS

MOTIVES ASSOCIATED TO SUMS OF GRAPHS MOTIVES ASSOCIATED TO SUMS OF GRAPHS SPENCER BLOCH 1. Introduction In quantum field theory, the path integral is interpreted perturbatively as a sum indexed by graphs. The coefficient (Feynman amplitude)

More information

Brane Brick Models, Toric Calabi-Yau 4-Folds and 2d (0,2) Quivers

Brane Brick Models, Toric Calabi-Yau 4-Folds and 2d (0,2) Quivers CCNY-HEP-5-07 SNUTP5-009 KIAS-P509 arxiv:50.0744v [hep-th] Feb 06 Brane Brick Models, Toric Calabi-Yau 4-Folds and d (0,) Quivers Sebastián Franco, a,b Sangmin Lee, c,d,e,f Rak-Kyeong Seong g a Physics

More information

Math 6510 Homework 10

Math 6510 Homework 10 2.2 Problems 9 Problem. Compute the homology group of the following 2-complexes X: a) The quotient of S 2 obtained by identifying north and south poles to a point b) S 1 (S 1 S 1 ) c) The space obtained

More information

On Vector Product Algebras

On Vector Product Algebras On Vector Product Algebras By Markus Rost. This text contains some remarks on vector product algebras and the graphical techniques. It is partially contained in the diploma thesis of D. Boos and S. Maurer.

More information

KAZHDAN LUSZTIG CELLS IN INFINITE COXETER GROUPS. 1. Introduction

KAZHDAN LUSZTIG CELLS IN INFINITE COXETER GROUPS. 1. Introduction KAZHDAN LUSZTIG CELLS IN INFINITE COXETER GROUPS MIKHAIL V. BELOLIPETSKY AND PAUL E. GUNNELLS 1. Introduction Groups defined by presentations of the form s 1,..., s n s 2 i = 1, (s i s j ) m i,j = 1 (i,

More information

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012 Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T

More information

BPS states, Wall-crossing and Quivers

BPS states, Wall-crossing and Quivers Iberian Strings 2012 Bilbao BPS states, Wall-crossing and Quivers IST, Lisboa Michele Cirafici M.C.& A.Sincovics & R.J. Szabo: 0803.4188, 1012.2725, 1108.3922 and M.C. to appear BPS States in String theory

More information

ON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS

ON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS ON WEAK CHROMATIC POLYNOMIALS OF MIXED GRAPHS MATTHIAS BECK, DANIEL BLADO, JOSEPH CRAWFORD, TAÏNA JEAN-LOUIS, AND MICHAEL YOUNG Abstract. A mixed graph is a graph with directed edges, called arcs, and

More information

Hypertoric varieties and hyperplane arrangements

Hypertoric varieties and hyperplane arrangements Hypertoric varieties and hyperplane arrangements Kyoto Univ. June 16, 2018 Motivation - Study of the geometry of symplectic variety Symplectic variety (Y 0, ω) Very special but interesting even dim algebraic

More information

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five Three-coloring triangle-free graphs on surfaces III. Graphs of girth five Zdeněk Dvořák Daniel Král Robin Thomas Abstract We show that the size of a 4-critical graph of girth at least five is bounded by

More information

Combinatorial Structures

Combinatorial Structures Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................

More information

SELF-DUAL GRAPHS BRIGITTE SERVATIUS AND HERMAN SERVATIUS

SELF-DUAL GRAPHS BRIGITTE SERVATIUS AND HERMAN SERVATIUS SELF-DUAL GRAPHS BRIGITTE SERVATIUS AND HERMAN SERVATIUS Abstract. We consider the three forms of self-duality that can be exhibited by a planar graph G, map self-duality, graph self-duality and matroid

More information

Lecture 3: Miscellaneous Techniques

Lecture 3: Miscellaneous Techniques Lecture 3: Miscellaneous Techniques Rajat Mittal IIT Kanpur In this document, we will take a look at few diverse techniques used in combinatorics, exemplifying the fact that combinatorics is a collection

More information

Spanning trees on the Sierpinski gasket

Spanning trees on the Sierpinski gasket Spanning trees on the Sierpinski gasket Shu-Chiuan Chang (1997-2002) Department of Physics National Cheng Kung University Tainan 70101, Taiwan and Physics Division National Center for Theoretical Science

More information

Antiferromagnetic Potts models and random colorings

Antiferromagnetic Potts models and random colorings Antiferromagnetic Potts models and random colorings of planar graphs. joint with A.D. Sokal (New York) and R. Kotecký (Prague) October 9, 0 Gibbs measures Let G = (V, E) be a finite graph and let S be

More information

Difference sets and Hadamard matrices

Difference sets and Hadamard matrices Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive

More information

Dimer models and cluster categories of Grassmannians

Dimer models and cluster categories of Grassmannians Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000 Dimer models and cluster categories of Grassmannians Karin Baur, Alastair King and Robert J. Marsh Abstract We associate

More information

Web of threefold bases in F-theory and machine learning

Web of threefold bases in F-theory and machine learning and machine learning 1510.04978 & 1710.11235 with W. Taylor CTP, MIT String Data Science, Northeastern; Dec. 2th, 2017 1 / 33 Exploring a huge oriented graph 2 / 33 Nodes in the graph Physical setup: 4D

More information

DOMINO TILINGS INVARIANT GIBBS MEASURES

DOMINO TILINGS INVARIANT GIBBS MEASURES DOMINO TILINGS and their INVARIANT GIBBS MEASURES Scott Sheffield 1 References on arxiv.org 1. Random Surfaces, to appear in Asterisque. 2. Dimers and amoebae, joint with Kenyon and Okounkov, to appear

More information

CK-12 Middle School Math Grade 8

CK-12 Middle School Math Grade 8 CK-12 Middle School Math aligned with COMMON CORE MATH STATE STANDARDS INITIATIVE Middle School Standards for Math Content Common Core Math Standards for CK-12 Middle School Math The Number System (8.NS)

More information