Graph Theoretical Cluster Expansion Formulas
|
|
- Junior Bennett
- 5 years ago
- Views:
Transcription
1 Graph Theoretical Cluster Expansion Formulas Gregg Musiker MIT December 9, 008 http//math.mit.edu/ musiker/graphtalk.pdf Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
2 Outline. Introduction Snake Graphs for Surfaces without Punctures Graphs for the Classical Types (Bipartite Seeds) Other Examples of Graph Theoretic Interpretations Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
3 Cluster Expansions Definition (Sergey Fomin and Andrei Zelevinsky 00) A cluster algebra A is a certain subalgebra of k(x,...,x m ), the field of rational functions over {x,...,x m }. Generators constructed by a series of exchange relations, which in turn induce all relations satisfied by the generators. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
4 Cluster Expansions Definition (Sergey Fomin and Andrei Zelevinsky 00) A cluster algebra A is a certain subalgebra of k(x,...,x m ), the field of rational functions over {x,...,x m }. Generators constructed by a series of exchange relations, which in turn induce all relations satisfied by the generators. Theorem. (The Laurent Phenomenon FZ 00) For any cluster algebra defined by initial seed ({x,x,...,x m },B), all cluster variables of A(B) are Laurent polynomials in {x,x,...,x m } (with no coefficient x n+,...,x m in the denominator). Thus, any cluster variable x α = Pα(x,...,x m) x α xn αn where P α Z[x,...,x n ]. (We use the notation x α since we only consider cases in this talk where denominator defines cluster variable.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
5 Cluster Expansions Definition (Sergey Fomin and Andrei Zelevinsky 00) A cluster algebra A is a certain subalgebra of k(x,...,x m ), the field of rational functions over {x,...,x m }. Generators constructed by a series of exchange relations, which in turn induce all relations satisfied by the generators. Theorem. (The Laurent Phenomenon FZ 00) For any cluster algebra defined by initial seed ({x,x,...,x m },B), all cluster variables of A(B) are Laurent polynomials in {x,x,...,x m } (with no coefficient x n+,...,x m in the denominator). Thus, any cluster variable x α = Pα(x,...,x m) x α xn αn where P α Z[x,...,x n ]. (We use the notation x α since we only consider cases in this talk where denominator defines cluster variable.) Conjecture. (Positivity Conjecture FZ 00) For any cluster variable x α the polynomial P α (x,...,x n ) has nonnegative integer coefficients. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
6 Some Prior Work on Positivity Conjecture Work of [Carroll-Price 00] gave expansion formulas for case of Ptolemy algeras, cluster algebras of type A n with boundary coefficients. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
7 Some Prior Work on Positivity Conjecture Work of [Carroll-Price 00] gave expansion formulas for case of Ptolemy algeras, cluster algebras of type A n with boundary coefficients. [FZ 00] proved positivity for finite type with bipartite seed. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
8 Some Prior Work on Positivity Conjecture Work of [Carroll-Price 00] gave expansion formulas for case of Ptolemy algeras, cluster algebras of type A n with boundary coefficients. [FZ 00] proved positivity for finite type with bipartite seed. [M-Propp 00, Sherman-Zelevinsky 00] proved positivity for rank two affine cluster algebras. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
9 Some Prior Work on Positivity Conjecture Work of [Carroll-Price 00] gave expansion formulas for case of Ptolemy algeras, cluster algebras of type A n with boundary coefficients. [FZ 00] proved positivity for finite type with bipartite seed. [M-Propp 00, Sherman-Zelevinsky 00] proved positivity for rank two affine cluster algebras. [Caldero-Zelevinsky 006] combinatorial formulas for Euler characteristic of Quiver Grassmannian of Kronecker Quiver. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
10 Some Prior Work on Positivity Conjecture Work of [Carroll-Price 00] gave expansion formulas for case of Ptolemy algeras, cluster algebras of type A n with boundary coefficients. [FZ 00] proved positivity for finite type with bipartite seed. [M-Propp 00, Sherman-Zelevinsky 00] proved positivity for rank two affine cluster algebras. [Caldero-Zelevinsky 006] combinatorial formulas for Euler characteristic of Quiver Grassmannian of Kronecker Quiver. Positivity also proven for those cluster variables for an acyclic seed [Caldero-Reineke 006], Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
11 Some Prior Work on Positivity Conjecture Work of [Carroll-Price 00] gave expansion formulas for case of Ptolemy algeras, cluster algebras of type A n with boundary coefficients. [FZ 00] proved positivity for finite type with bipartite seed. [M-Propp 00, Sherman-Zelevinsky 00] proved positivity for rank two affine cluster algebras. [Caldero-Zelevinsky 006] combinatorial formulas for Euler characteristic of Quiver Grassmannian of Kronecker Quiver. Positivity also proven for those cluster variables for an acyclic seed [Caldero-Reineke 006], as well as for Cluster algebras arising from unpunctured surfaces [Schiffler-Thomas 007, Schiffler 008], generalizing Trails model of Carroll-Price. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
12 Cluster Algebras of Triangulated Surfaces We follow (Fomin-Shapiro-Thurston) and have a surface (S,M). We assume marked points M S (no punctures). Recall an arc γ satisfies (we care about arcs up to isotopy) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
13 Cluster Algebras of Triangulated Surfaces We follow (Fomin-Shapiro-Thurston) and have a surface (S,M). We assume marked points M S (no punctures). Recall an arc γ satisfies (we care about arcs up to isotopy) The endpoints of γ are in M. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
14 Cluster Algebras of Triangulated Surfaces We follow (Fomin-Shapiro-Thurston) and have a surface (S,M). We assume marked points M S (no punctures). Recall an arc γ satisfies (we care about arcs up to isotopy) The endpoints of γ are in M. γ does not cross itself. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
15 Cluster Algebras of Triangulated Surfaces We follow (Fomin-Shapiro-Thurston) and have a surface (S,M). We assume marked points M S (no punctures). Recall an arc γ satisfies (we care about arcs up to isotopy) The endpoints of γ are in M. γ does not cross itself. relative interior of γ is disjoint from M and the boundary of S. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
16 Cluster Algebras of Triangulated Surfaces We follow (Fomin-Shapiro-Thurston) and have a surface (S,M). We assume marked points M S (no punctures). Recall an arc γ satisfies (we care about arcs up to isotopy) The endpoints of γ are in M. γ does not cross itself. relative interior of γ is disjoint from M and the boundary of S. γ does not cut out a monogon or digon. Seed Triangulation T = {,,..., n } Cluster Variable Arc γ x i i T. For γ T let e i (T : γ) be the minimal intersection number of i and γ. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
17 A Graph Theoretic Approach Recall from Ralf Schiffler s Talk: Theorem. (M-Schiffler 008) For every triangulation T (in a surface without punctures) and arc γ, we construct a snake graph G γ,t such that perfect matching M of G x γ = γ,t x(m)y(m) x e (T,γ) x e (T,γ) xn en(t,γ) where e i (T,γ) is the crossing number of i and γ, and x(m), y(m) are each monomials. (x γ is cluster variable with principal coefficients.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
18 A Graph Theoretic Approach Recall from Ralf Schiffler s Talk: Theorem. (M-Schiffler 008) For every triangulation T (in a surface without punctures) and arc γ, we construct a snake graph G γ,t such that perfect matching M of G x γ = γ,t x(m)y(m) x e (T,γ) x e (T,γ) xn en(t,γ) where e i (T,γ) is the crossing number of i and γ, and x(m), y(m) are each monomials. (x γ is cluster variable with principal coefficients.) Definition. Given a simple undirected graph G = (V,E), a perfect matching M E is a set of distinguished edges so that every vertex of V is covered exactly once. (Each edge has weight x(e) where x(e) is allowed to be (unweighted) or some variable x i.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
19 A Graph Theoretic Approach Recall from Ralf Schiffler s Talk: Theorem. (M-Schiffler 008) For every triangulation T (in a surface without punctures) and arc γ, we construct a snake graph G γ,t such that perfect matching M of G x γ = γ,t x(m)y(m) x e (T,γ) x e (T,γ) xn en(t,γ) where e i (T,γ) is the crossing number of i and γ, and x(m), y(m) are each monomials. (x γ is cluster variable with principal coefficients.) Definition. Given a simple undirected graph G = (V,E), a perfect matching M E is a set of distinguished edges so that every vertex of V is covered exactly once. (Each edge has weight x(e) where x(e) is allowed to be (unweighted) or some variable x i.) The weight of a matching M is the product of the weights of the constituent edges, i.e. x(m) = e M x(e). Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
20 Example of Octagon 8 9 γ Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
21 Example of Octagon 8 9 γ Recall that are 5 completed (T,γ)-paths of this octagon, with weights x + x x + x x + x x + x x 5 x x x 5. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
22 Example of Octagon (continued) 5 Consider the graph G TO,γ = G TO,γ has five perfect matchings (x 7,x 8,...,x = ): x (x 8 )x (x ), x (x 7 )x (x ), x (x 8 )x (x ), (x 7 )x x (x ), (x 7 )x x 5 (x ). Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
23 Example of Octagon (continued) 5 Consider the graph G TO,γ = G TO,γ has five perfect matchings (x 7,x 8,...,x = ): x (x 8 )x (x ), x (x 7 )x (x ), x (x 8 )x (x ), (x 7 )x x (x ), (x 7 )x x 5 (x ). Dividing each monomial by x x x 5, we obtain weights of (T,γ)-paths. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
24 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
25 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
26 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Let i (for j d ) denote the triangles bounded by arcs ij and ij+. ( 0 and d denote the first and last triangles that γ traverses.) Let [γ j ] denote the third side of j for j d. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
27 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Let i (for j d ) denote the triangles bounded by arcs ij and ij+. ( 0 and d denote the first and last triangles that γ traverses.) Let [γ j ] denote the third side of j for j d. 5 By convention Let G γ, := S i. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
28 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Let i (for j d ) denote the triangles bounded by arcs ij and ij+. ( 0 and d denote the first and last triangles that γ traverses.) Let [γ j ] denote the third side of j for j d. 5 By convention Let G γ, := S i. 6 Inductively attach tile S ij+ to graph G γ,j to obtain G γ,j+. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
29 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Let i (for j d ) denote the triangles bounded by arcs ij and ij+. ( 0 and d denote the first and last triangles that γ traverses.) Let [γ j ] denote the third side of j for j d. 5 By convention Let G γ, := S i. 6 Inductively attach tile S ij+ to graph G γ,j to obtain G γ,j+. (N or E edge of G γ,j agrees with tile S ij+ : N E and S W ) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
30 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Let i (for j d ) denote the triangles bounded by arcs ij and ij+. ( 0 and d denote the first and last triangles that γ traverses.) Let [γ j ] denote the third side of j for j d. 5 By convention Let G γ, := S i. 6 Inductively attach tile S ij+ to graph G γ,j to obtain G γ,j+. (N or E edge of G γ,j agrees with tile S ij+ : N E and S W ) 7 We define G T,γ to be G γ,d. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
31 How to construct G T,γ s (unpunctured surfaces) Definition. For i n (i.e. all i T), define Tile S i to be (weighted) triangulated quadrilateral homeomorphic to the quadrilateral bounding arc i in surface S. (Diagonal NW SE and opposite sides still opposite) Now given arc γ: Pick orientation of γ : s t. Label p 0 = s,p,...,p d,p d+ = t, the intersection points of γ with T (p j ij ). Let i (for j d ) denote the triangles bounded by arcs ij and ij+. ( 0 and d denote the first and last triangles that γ traverses.) Let [γ j ] denote the third side of j for j d. 5 By convention Let G γ, := S i. 6 Inductively attach tile S ij+ to graph G γ,j to obtain G γ,j+. (N or E edge of G γ,j agrees with tile S ij+ : N E and S W ) 7 We define G T,γ to be G γ,d. (Erase diagonals to obtain G T,γ.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
32 Examples of G T,γ 8 9 γ 7 6 Example. Use above construction for 0 5 : Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
33 Examples of G T,γ 8 9 γ 7 6 Example. Use above construction for 0 5 : 7 8 Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
34 Examples of G T,γ 8 9 γ 7 6 Example. Use above construction for 0 5 : , 8 Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
35 Examples of G T,γ 8 9 γ 7 6 Example. Use above construction for 0 5 : , 8 7, Thus 5 G TO,γ = Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
36 Examples of G T,γ (continued) Example. We now construct graph G TA,γ. γ Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
37 Examples of G T,γ (continued) Example. We now construct graph G TA,γ. γ Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
38 Height Functions (of Perfect Matchings of Snake Graphs) We now wish to give formula for y(m) s, i.e. the terms in the F-polynomials. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
39 Height Functions (of Perfect Matchings of Snake Graphs) We now wish to give formula for y(m) s, i.e. the terms in the F-polynomials. Definiton. [W. Thurston-Conway] (Following description of [Elkies-Larsen-Kuperberg-Propp]) Given a snake graph G, up to orientation, there is a choice of minimal matching (M ) which consists of every-other edge on the boundary. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
40 Height Functions (of Perfect Matchings of Snake Graphs) We now wish to give formula for y(m) s, i.e. the terms in the F-polynomials. Definiton. [W. Thurston-Conway] (Following description of [Elkies-Larsen-Kuperberg-Propp]) Given a snake graph G, up to orientation, there is a choice of minimal matching (M ) which consists of every-other edge on the boundary. Given any other matching M, let M M denote the symmetric difference. The height h M : Faces(G) Z 0 of matching M is a function recording which faces are enclosed by M M. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
41 Height Functions (of Perfect Matchings of Snake Graphs) We now wish to give formula for y(m) s, i.e. the terms in the F-polynomials. Definiton. [W. Thurston-Conway] (Following description of [Elkies-Larsen-Kuperberg-Propp]) Given a snake graph G, up to orientation, there is a choice of minimal matching (M ) which consists of every-other edge on the boundary. Given any other matching M, let M M denote the symmetric difference. The height h M : Faces(G) Z 0 of matching M is a function recording which faces are enclosed by M M. For snake graphs, h M (F) {0,} and we obtain the formula y(m) := i y P Faces Labeled i h M(F) i. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
42 Height Function Examples Recall that G TO,γ has three faces, labeled, and 5. G TO,γ has five perfect matchings (x 7,x 8,...,x = ): x y y y 5, x x y y 5, x x y y, x x y, x x 5 (). ( This matching is M.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
43 Height Function Examples Recall that G TO,γ has three faces, labeled, and 5. G TO,γ has five perfect matchings (x 7,x 8,...,x = ): x y y y 5, x x y y 5, x x y y, x x y, x x 5 (). ( This matching is M.) For example, we get heights y y, y, and y y 5 because of superpositions:,, and 5 Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
44 Height Function Examples (continued) For G TA,γ = 5, M is. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
45 Height Function Examples (continued) For G TA,γ = 5, M is. One of the 7 matchings, M, is, Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
46 Height Function Examples (continued) For G TA,γ = 5, M is. One of the 7 matchings, M, is, so M M =, Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
47 Height Function Examples (continued) For G TA,γ = 5, M is. One of the 7 matchings, M, is, so M M =, which has height y y. So one of the 7 terms in the cluster expansion of x x γ is x x x x (y y x ). Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
48 Summary Theorem. (M-Schiffler 008) For every triangulation T of unpunctured surface and arc γ, we construct a snake graph G γ,t such that perfect matching M of G x γ = γ,t x(m)y(m) x e (T,γ) x e (T,γ) xn en(t,γ) where e i (T,γ) is the crossing number of i and γ, x(m) is the edge-weight of perfect matching M, and y(m) is the height of perfect matching M. (x γ is cluster variable with principal coefficients.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
49 Summary Theorem. (M-Schiffler 008) For every triangulation T of unpunctured surface and arc γ, we construct a snake graph G γ,t such that perfect matching M of G x γ = γ,t x(m)y(m) x e (T,γ) x e (T,γ) xn en(t,γ) where e i (T,γ) is the crossing number of i and γ, x(m) is the edge-weight of perfect matching M, and y(m) is the height of perfect matching M. (x γ is cluster variable with principal coefficients.) Corollary. The F-polynomial equals M y(m), is positive, and has constant term. The g-vector satisfies x g = x(m ). Corollary. The Laurent expansion of cluster variable x γ is positive for any cluster algebra (of geometric type) arising from a triangulated surface without punctures. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
50 Partially Generalizes Earlier Work on Classical Types Theorem. (M 007) For every classical root system, let B Φ denote the corresponding bipartite seed (without coefficients). Then there exists a family of graphs G Φ = {G α } α Φ+ such that x α, the cluster variable of A(B Φ ) corresponding to α Φ +, can be expressed as x α = P G α (x,...,x n ) x α. xαn n Further, we will construct the graphs in a very simple manner using the tiles T k. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
51 Tiles for the four classical types A x x x x x x x x C x x x x x x x x x Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
52 Graphs for A n and C n A Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
53 Graphs for A n and C n (cont.) C folds onto A 5 (Take right-half including middle) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
54 Tiles for the four classical types (cont.) x x x x x x 5 x 5 x B 5 x x x x x x x x D 5 x Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
55 The B n and D n cases B After mutating with respect to x and x (x and x ), we obtain Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
56 The B n and D n cases (cont.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
57 The B n and D n cases (cont.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
58 D 5 The B n and D n cases (cont.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
59 The B n and D n cases (cont.) D 5 (cont.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
60 The B n and D n cases (cont.) D 5 (cont.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
61 The B n and D n cases (cont.) D 5 (cont.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
62 G Seed matrix is B = [ ] 0 0 Hexagon has x on NW, NE, and S sides, Trapezoid has x on N side. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
63 Affine Rank Joint work with Jim Propp. [ ] [ ] 0 0 Let B = or. 0 0 Here we also exploit invariance of matrices B under mutation. So we are considering (b,c)-sequence { xn b + if n odd x n x n = + if n even for (b,c) = (,) or (,). x c n Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
64 Affine Rank (cont.) Since cluster algebra structure, (b,c) sequence consists of Laurent polynomials. Work of Sherman and Zelevinsky verifies positive coefficients for (,) and (,) using Newton polytope, and Caldero-Zelevinsky give another proof of positivity for (,) case via Quiver Grassmannians. This cluster algebra also comes from an annulus with one marked point on each boundary (no punctures). Equivalently, this is a cluster algebra of affine type Ã,. We give proof of positivity via graph theoretical interpretation similar to above. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
65 Affine Rank (cont.) (,): all cluster variables have denominators x dxd+ (resp. x d+ x d) We string together corresponding number of sqares x x x x in an intertwining fashion. Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
66 Affine Rank (cont.) (,): all cluster variables have denominators x dxd+ (resp. x d+ x d) We string together corresponding number of sqares x x x x in an intertwining fashion. Examples: x + x ++x x x x 6 + x + x + x x +x ++ x x x Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
67 Affine Rank (cont.) (,): Tiles are a square and an octagon: x 0 x Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
68 Sequnce Continues x 7 terms x 5 9 terms x 6 86 terms x 7 terms Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
69 Sequnce Continues (cont.) x terms x 9 06 terms x 0 0 terms x 987 terms Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, 008 / 9
70 Running the (, ) sequence backwards x terms x terms x terms x 97 terms Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
71 Running the (, ) sequence backwards (cont.) x 5 67 terms x terms x 7 terms x terms Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
72 Markoff polynomials Joint work by Carroll, Itsara, Le, M, Price, Thurston, and Viana under Propp in REACH program. 0 B = 0, Exchange graph is free ternary tree. 0 B invariant under mutation. All exchanges have form (x,y,z) (x,y,z) where xx = y + z. (Cluster algebra corresponds to once punctured torus.) Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
73 Markoff polynomials Joint work by Carroll, Itsara, Le, M, Price, Thurston, and Viana under Propp in REACH program. 0 B = 0, Exchange graph is free ternary tree. 0 B invariant under mutation. All exchanges have form (x,y,z) (x,y,z) where xx = y + z. (Cluster algebra corresponds to once punctured torus.) These also have graph theoretic interpretation: Snake Graphs,.e.g Polynomial(x,y,z) x y z x y x z x y x with tiles y x y z x z z y z x z y x y x Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
74 Work in Progress with Ralf Schiffler and Lauren Williams Theorem. Formulas for F-polynomials and g-vectors for types A, B, C, D with respect to any seed (not nec. acyclic). In Progress. Snake Graph Interpretations for Triangulated Surfaces (even in prescence of punctures). Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
75 Thank You For Listening Cluster Expansion Formulas and Perfect Matchings (with Ralf Schiffler), arxiv:math.co/ A Graph Theoretic Expansion Formula for Cluster Algebras of Classical Type, musiker/finite.pdf, (To appear in the Annals of Combinatorics) Combinatorial Interpretations for Rank-Two Cluster Algebras of Affine Type (with Jim Propp), Electronic Journal of Combinatorics. Vol. (R5), 007. The Combinatorics of Frieze Patterns and Markoff Numbers (by Jim Propp), arxiv:math.co/056 Slides Available at http//math.mit.edu/ musiker/graphtalk.pdf Gregg Musiker (MIT) Graph Theoretical Cluster Expansions December 9, / 9
INTRODUCTION TO CLUSTER ALGEBRAS
INTRODUCTION TO CLUSTER ALGEBRAS NAN LI (MIT) Cluster algebras are a class of commutative ring, introduced in 000 by Fomin and Zelevinsky, originally to study Lusztig s dual canonical basis and total positivity.
More informationNewton Polytopes of Cluster Variables. Adam Michael Kalman. A dissertation submitted in partial satisfaction of the. requirements for the degree of
Newton Polytopes of Cluster Variables by Adam Michael Kalman A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division
More informationMutation-linear algebra and universal geometric cluster algebras
Mutation-linear algebra and universal geometric cluster algebras Nathan Reading NC State University Mutation-linear ( µ-linear ) algebra Universal geometric cluster algebras The mutation fan Universal
More informationLecture 3A: Generalized associahedra
Lecture 3A: Generalized associahedra Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Associahedron and cyclohedron
More informationCombinatorics of X -variables in finite type cluster algebras
Combinatorics of X -variables in finite type cluster algebras arxiv:1803.02492 Slides available at www.math.berkeley.edu/~msb Melissa Sherman-Bennett, UC Berkeley AMS Fall Central Sectional Meeting 2018
More informationA fan for every cluster algebra
A fan for every cluster algebra Nathan Reading NC State University Combinatorics and beyond: the many facets of Sergey Fomin s mathematics University of Michigan November 8-11, 2018 Cluster algebras of
More informationLecture 4A: Combinatorial frameworks for cluster algebras
Lecture 4A: Combinatorial frameworks for cluster algebras Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Frameworks
More informationCluster algebras from surfaces
Cluster algebras from surfaces Lecture notes for the CIMPA School Mar del Plata, March 206 Ralf Schiffler University of Connecticut 2 Contents 0 Introduction 5 Cluster algebras 7. Ground ring ZP..........................
More informationNewton Polytopes of Cluster Variables of Type A_n
Newton Polytopes of Cluster Variables of Type A_n Adam Kalman To cite this version: Adam Kalman. Newton Polytopes of Cluster Variables of Type A_n. Louis J. Billera and Isabella Novik. 26th International
More informationCombinatorics of X -variables in Finite Type Cluster Algebras
Combinatorics of X -variables in Finite Type Cluster Algebras Melissa Sherman-Bennett January 31 2018 Abstract We compute the number of X -variables (also called coefficients) of a cluster algebra of finite
More informationQGM Master Class Cluster algebras June Lectures Sergey Fomin (University of Michigan)
QGM Master Class Cluster algebras June 2010 Lectures 11-15 Sergey Fomin (University of Michigan) Example 1: Clusters and exchange relations in C[Gr 2,6 ] faces cluster variables vertices clusters edges
More informationCluster algebras and infinite associahedra
Cluster algebras and infinite associahedra Nathan Reading NC State University CombinaTexas 2008 Coxeter groups Associahedra and cluster algebras Sortable elements/cambrian fans Infinite type Much of the
More informationIndependence for Exchange Graphs and Cluster Complexes
Independence for Exchange Graphs and Cluster Complexes P.-G. Plamondon October 29, 2012 Joint work with G. Cerulli Irelli, B. Keller, D. Labardini-Fragoso. 1 Exchange Graphs and Cluster Complexes Setting:
More informationDurham E-Theses. On the combinatorics of quivers, mutations and cluster algebra exchange graphs LAWSON, JOHN,WILLIAM
Durham E-Theses On the combinatorics of quivers, mutations and cluster algebra exchange graphs LAWSON, JOHN,WILLIAM How to cite: LAWSON, JOHN,WILLIAM (017) On the combinatorics of quivers, mutations and
More informationTwo-bridge knots and links
CHAPTER 0 Two-bridge knots and links In this chapter we will study in detail a class of knots and links that has particularly nice geometry, namely the class of 2-bridge knots and links. The key property
More informationarxiv: v4 [math.co] 25 Apr 2010
QUIVERS OF FINITE MUTATION TYPE AND SKEW-SYMMETRIC MATRICES arxiv:0905.3613v4 [math.co] 25 Apr 2010 AHMET I. SEVEN Abstract. Quivers of finite mutation type are certain directed graphs that first arised
More informationConway s Tiling Groups
Conway s Tiling Groups Elissa Ross Department of Mathematics University of British Columbia, BC, Canada elissa@math.ubc.ca December 12, 2004 Abstract In this paper I discuss a method of John Conway for
More informationTHE BROKEN PTOLEMY ALGEBRA: A FINITE-TYPE LAURENT PHENOMENON ALGEBRA
THE BROKEN PTOLEMY ALGEBRA: A FINITE-TYPE LAURENT PHENOMENON ALGEBRA SHANNON GALLAGHER AND ABBY STEVENS Abstract. Type A, or Ptolemy cluster algebras are a prototypical example of finite type cluster algebras,
More informationNegative Numbers in Combinatorics: Geometrical and Algebraic Perspectives
Negative Numbers in Combinatorics: Geometrical and Algebraic Perspectives James Propp (UMass Lowell) June 29, 2012 Slides for this talk are on-line at http://jamespropp.org/msri-up12.pdf 1 / 99 I. Equal
More informationNew Graphs of Finite Mutation Type
Ne Graphs of Finite Mutation Type Harm Derksen Department of Mathematics University of Michigan hderksen@umich.edu Theodore Oen Department of Mathematics Ioa State University oentheo@isu.edu Submitted:
More informationSPERNER S LEMMA MOOR XU
SPERNER S LEMMA MOOR XU Abstract. Is it possible to dissect a square into an odd number of triangles of equal area? This question was first answered by Paul Monsky in 970, and the solution requires elements
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationThe Geodesic Integral on Medial Graphs
The Geodesic Integral on Medial Graphs Kolya Malkin August 013 We define the geodesic integral defined on paths in the duals of medial graphs on surfaces and use it to study lens elimination and connection
More informationLecture 4: Bipartite graphs and planarity
Lecture 4: Bipartite graphs and planarity Anders Johansson 2011-10-22 lör Outline Bipartite graphs A graph G is bipartite with bipartition V1, V2 if V = V1 V2 and all edges ij E has one end in V1 and V2.
More informationMinimal mutation-infinite quivers. Introduction. Quivers. John Lawson. Workshop on Cluster Algebras and finite dimensional algebras
Durham University John Lawson Workshop on Cluster Algebras and finite dimensional algebras John Lawson Thank organisers for the conference. Durham University Workshop on Cluster Algebras and finite dimensional
More informationClassification of Ehrhart quasi-polynomials of half-integral polygons
Classification of Ehrhart quasi-polynomials of half-integral polygons A thesis presented to the faculty of San Francisco State University In partial fulfilment of The Requirements for The Degree Master
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationBoardworks Ltd KS3 Mathematics. S1 Lines and Angles
1 KS3 Mathematics S1 Lines and Angles 2 Contents S1 Lines and angles S1.1 Labelling lines and angles S1.2 Parallel and perpendicular lines S1.3 Calculating angles S1.4 Angles in polygons 3 Lines In Mathematics,
More informationIntegrated Math I. IM1.1.3 Understand and use the distributive, associative, and commutative properties.
Standard 1: Number Sense and Computation Students simplify and compare expressions. They use rational exponents and simplify square roots. IM1.1.1 Compare real number expressions. IM1.1.2 Simplify square
More informationEnumeration of Tilings and Related Problems
Enumeration of Tilings and Related Problems Tri Lai Institute for Mathematics and its Applications Minneapolis, MN 55455 Discrete Mathematics Seminar University of British Columbia Vancouver February 2016
More informationOn the Heegaard splittings of amalgamated 3 manifolds
On the Heegaard splittings of amalgamated 3 manifolds TAO LI We give a combinatorial proof of a theorem first proved by Souto which says the following. Let M 1 and M 2 be simple 3 manifolds with connected
More informationAll tunnels of all tunnel number 1 knots
All tunnels of all tunnel number 1 knots Darryl McCullough University of Oklahoma Geometric Topology Conference Beijing University June 22, 27 1 (joint work with Sangbum Cho, in The tree of knot tunnels,
More informationBoundary Curves of Incompressible Surfaces
Boundary Curves of Incompressible Surfaces Allen Hatcher This is a Tex version, made in 2004, of a paper that appeared in Pac. J. Math. 99 (1982), 373-377, with some revisions in the exposition. Let M
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationDecomposition of the figure-8 knot
CHAPTER 1 Decomposition of the figure-8 knot This book is an introduction to knots, links, and their geometry. Before we begin, we need to define carefully exactly what we mean by knots and links, and
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationLecture 3. Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets. Tepper School of Business Carnegie Mellon University, Pittsburgh
Lecture 3 Corner Polyhedron, Intersection Cuts, Maximal Lattice-Free Convex Sets Gérard Cornuéjols Tepper School of Business Carnegie Mellon University, Pittsburgh January 2016 Mixed Integer Linear Programming
More informationCOMBINATORIC AND ALGEBRAIC ASPECTS OF A CLASS OF PLANAR GRAPHS
Communications to SIMAI Congress, ISSN 87-905, Vol. (007 DOI: 0.685/CSC060 COMBINATORIC AND ALGEBRAIC ASPECTS OF A CLASS OF PLANAR GRAPHS M. LA BARBIERA Department of Mathematics, University of Messina,
More informationA history of the Associahedron
Laura Escobar Cornell University Olivetti Club February 27, 2015 The associahedron A history of the Catalan numbers The associahedron Toric variety of the associahedron Toric varieties The algebraic variety
More informationCombinatorics of cluster structures in Schubert varieties
Combinatorics of cluster structures in Schubert varieties arxiv:1902.00807 Slides available at www.math.berkeley.edu/~msb M. Sherman-Bennett (UC Berkeley) joint work with K. Serhiyenko and L. Williams
More informationMajority and Friendship Paradoxes
Majority and Friendship Paradoxes Majority Paradox Example: Small town is considering a bond initiative in an upcoming election. Some residents are in favor, some are against. Consider a poll asking the
More informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More informationPunctured Torus Groups
Punctured Torus Groups Talk by Yair Minsky August, 7 One of the simplest classes of examples of Kleinian surface groups is given by punctured torus groups. We define a punctured torus group to be a discrete
More informationCS 311 Discrete Math for Computer Science Dr. William C. Bulko. Graphs
CS 311 Discrete Math for Computer Science Dr. William C. Bulko Graphs 2014 Definitions Definition: A graph G = (V,E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationThe Graphs of Triangulations of Polygons
The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationINTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES
INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance
More informationThe Farey Tessellation
The Farey Tessellation Seminar: Geometric Structures on manifolds Mareike Pfeil supervised by Dr. Gye-Seon Lee 15.12.2015 Introduction In this paper, we are going to introduce the Farey tessellation. Since
More informationOn the Component Number of Links from Plane Graphs
On the Component Number of Links from Plane Graphs Daniel S. Silver Susan G. Williams January 20, 2015 Abstract A short, elementary proof is given of the result that the number of components of a link
More informationLattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder
Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so
More informationTangencies between disjoint regions in the plane
June 16, 20 Problem Definition Two nonoverlapping Jordan regions in the plane are said to touch each other or to be tangent to each other if their boundaries have precisely one point in common and their
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More informationHamiltonian cycles in bipartite quadrangulations on the torus
Hamiltonian cycles in bipartite quadrangulations on the torus Atsuhiro Nakamoto and Kenta Ozeki Abstract In this paper, we shall prove that every bipartite quadrangulation G on the torus admits a simple
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationThe combinatorics of frieze patterns and Markoff numbers
Formal Power Series and lgebraic Combinatorics Séries Formelles et Combinatoire lgébrique San Diego, California 2006 The combinatorics of frieze patterns and Markoff numbers James Propp BSTRCT. This article,
More informationAny questions about the material so far? About the exercises?
Any questions about the material so far? About the exercises? Here is a question for you. In the diagram on the board, DE is parallel to AC, DB = 4, AB = 9 and BE = 8. What is the length EC? Polygons Definitions:
More informationPlane Tilings. Richard P. Stanley M.I.T. Plane Tilings p.
Plane Tilings p. Plane Tilings Richard P. Stanley M.I.T. Plane Tilings p. region: tiles: 1 2 3 4 5 6 7 Plane Tilings p. tiling: 4 3 7 5 6 2 1 Plane Tilings p. Is there a tiling? How many? About how many?
More informationIntroduction to Graph Theory
Introduction to Graph Theory Tandy Warnow January 20, 2017 Graphs Tandy Warnow Graphs A graph G = (V, E) is an object that contains a vertex set V and an edge set E. We also write V (G) to denote the vertex
More informationHeegaard splittings and virtual fibers
Heegaard splittings and virtual fibers Joseph Maher maher@math.okstate.edu Oklahoma State University May 2008 Theorem: Let M be a closed hyperbolic 3-manifold, with a sequence of finite covers of bounded
More informationDiscrete Wiskunde II. Lecture 6: Planar Graphs
, 2009 Lecture 6: Planar Graphs University of Twente m.uetz@utwente.nl wwwhome.math.utwente.nl/~uetzm/dw/ Planar Graphs Given an undirected graph (or multigraph) G = (V, E). A planar embedding of G is
More informationPOLYTOPES. Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of convex polytopes.
POLYTOPES MARGARET A. READDY 1. Lecture I: Introduction to Polytopes and Face Enumeration Grünbaum and Shephard [40] remarked that there were three developments which foreshadowed the modern theory of
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationTrinities, hypergraphs, and contact structures
Trinities, hypergraphs, and contact structures Daniel V. Mathews Daniel.Mathews@monash.edu Monash University Discrete Mathematics Research Group 14 March 2016 Outline 1 Introduction 2 Combinatorics of
More informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationAlgebraic method for Shortest Paths problems
Lecture 1 (06.03.2013) Author: Jaros law B lasiok Algebraic method for Shortest Paths problems 1 Introduction In the following lecture we will see algebraic algorithms for various shortest-paths problems.
More informationTrees and Matchings. James G. Propp. University of Wisconsin Madison, Wisconsin
Trees and Matchings arxiv:math/99325v2 [math.co] 3 Apr 2 Richard W. Kenyon Laboratoire de Topologie Université Paris-Sud kenyon@topo.math.u-psud.fr James G. Propp University of Wisconsin Madison, Wisconsin
More informationCLUSTER ALGEBRAS AND COXETER GROUPS
CLUSTER ALGEBRAS AND COXETER GROUPS ANNA FELIKSON Abstract. Coxeter groups are classical objects appearing in connection with symmetry groups of regular polytopes and various tessellations. Cluster algebras
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationCyclotomic Polytopes and Growth Series of Cyclotomic Lattices. Matthias Beck & Serkan Hoşten San Francisco State University
Cyclotomic Polytopes and Growth Series of Cyclotomic Lattices Matthias Beck & Serkan Hoşten San Francisco State University math.sfsu.edu/beck Math Research Letters Growth Series of Lattices L R d lattice
More informationGraphs (MTAT , 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402
Graphs (MTAT.05.080, 6 EAP) Lectures: Mon 14-16, hall 404 Exercises: Wed 14-16, hall 402 homepage: http://courses.cs.ut.ee/2012/graafid (contains slides) For grade: Homework + three tests (during or after
More informationFEDOR V. FOMIN. Lectures on treewidth. The Parameterized Complexity Summer School 1-3 September 2017 Vienna, Austria
FEDOR V. FOMIN Lectures on treewidth The Parameterized Complexity Summer School 1-3 September 2017 Vienna, Austria Why treewidth? Very general idea in science: large structures can be understood by breaking
More informationarxiv: v1 [math.gt] 28 Feb 2009
Coverings and Minimal Triangulations of 3 Manifolds William Jaco, Hyam Rubinstein and Stephan Tillmann arxiv:0903.0112v1 [math.gt] 28 Feb 2009 Abstract This paper uses results on the classification of
More informationHands-On Standards Deluxe Grades: 7, 8 States: California Content Standards
Hands-On Standards Deluxe Grades: 7, 8 States: Hands-On Standards Deluxe Edition Kit, Grades 5-6: Algebra Summary: This resource guide meets 5 and 6 math curriculum standards by matching activities to
More informationarxiv: v2 [math.co] 24 Aug 2016
Slicing and dicing polytopes arxiv:1608.05372v2 [math.co] 24 Aug 2016 Patrik Norén June 23, 2018 Abstract Using tropical convexity Dochtermann, Fink, and Sanyal proved that regular fine mixed subdivisions
More informationLecture 3: Graphs and flows
Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected
More informationPartitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths
Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths Master Thesis Patrick Schnider July 25, 2015 Advisors: Prof. Dr. Emo Welzl, Manuel Wettstein Department of
More informationSurfaces Beyond Classification
Chapter XII Surfaces Beyond Classification In most of the textbooks which present topological classification of compact surfaces the classification is the top result. However the topology of 2- manifolds
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationPlanarity. 1 Introduction. 2 Topological Results
Planarity 1 Introduction A notion of drawing a graph in the plane has led to some of the most deep results in graph theory. Vaguely speaking by a drawing or embedding of a graph G in the plane we mean
More informationGRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
More informationList Coloring Graphs
List Coloring Graphs January 29, 2004 CHROMATIC NUMBER Defn 1 A k coloring of a graph G is a function c : V (G) {1, 2,... k}. A proper k coloring of a graph G is a coloring of G with k colors so that no
More informationWhich n-venn diagrams can be drawn with convex k-gons?
Which n-venn diagrams can be drawn with convex k-gons? Jeremy Carroll Frank Ruskey Mark Weston Abstract We establish a new lower bound for the number of sides required for the component curves of simple
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationA Genus Bound for Digital Image Boundaries
A Genus Bound for Digital Image Boundaries Lowell Abrams and Donniell E. Fishkind March 9, 2005 Abstract Shattuck and Leahy [4] conjectured and Abrams, Fishkind, and Priebe [1],[2] proved that the boundary
More information0 efficient triangulations of Haken three-manifolds
The University of Melbourne Doctoral Thesis 0 efficient triangulations of Haken three-manifolds Shanil Ramanayake A thesis submitted in fulfilment of the requirements for the degree of Doctor of Philosophy
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationThe Cyclic Cycle Complex of a Surface
The Cyclic Cycle Complex of a Surface Allen Hatcher A recent paper [BBM] by Bestvina, Bux, and Margalit contains a construction of a cell complex that gives a combinatorial model for the collection of
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationLecture 5 CLASSIFICATION OF SURFACES
Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the
More informationBasics of Graph Theory
Basics of Graph Theory 1 Basic notions A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their
More informationarxiv: v2 [math.gt] 12 Nov 2018
Knot Invariants from Laplacian Matrices Daniel S. Silver Susan G. Williams November 13, 2018 arxiv:1809.06492v2 [math.gt] 12 Nov 2018 Abstract A checkerboard graph of a special diagram of an oriented link
More informationThe geometry and combinatorics of closed geodesics on hyperbolic surfaces
The geometry and combinatorics of closed geodesics on hyperbolic surfaces CUNY Graduate Center September 8th, 2015 Motivating Question: How are the algebraic/combinatoric properties of closed geodesics
More informationBasic Euclidean Geometry
hapter 1 asic Euclidean Geometry This chapter is not intended to be a complete survey of basic Euclidean Geometry, but rather a review for those who have previously taken a geometry course For a definitive
More informationMATH 350 GRAPH THEORY & COMBINATORICS. Contents
MATH 350 GRAPH THEORY & COMBINATORICS PROF. SERGEY NORIN, FALL 2013 Contents 1. Basic definitions 1 2. Connectivity 2 3. Trees 3 4. Spanning Trees 3 5. Shortest paths 4 6. Eulerian & Hamiltonian cycles
More informationCLASSIFICATION OF SURFACES
CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents
More information