Combinatorics of X -variables in finite type cluster algebras
|
|
- Joleen Carson
- 5 years ago
- Views:
Transcription
1 Combinatorics of X -variables in finite type cluster algebras arxiv: Slides available at Melissa Sherman-Bennett, UC Berkeley AMS Fall Central Sectional Meeting 2018 M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
2 Big Picture (Fock Goncharov (2009)) Cluster varieties in 2 flavors: A-varieties (with A-variables) and X -varieties (with X -variables) A-variables cluster variables X -variables coefficients There is a duality between A-varieties and X -varieties (GHKK (2018)), but on the algebraic side much less is understood about X -variables X -variables appear naturally in total positivity and in scattering amplitudes in N = 4 Super Yang-Mills theory (GGSVV (2014)) M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
3 Definitions Let F = Q(t 1,..., t n ). An X -seed Σ in F is a pair (x, B), where x = (x 1,..., x n ) with x i F and B = (b ij ) is a skew-symmetrizable n n integer matrix. Mutation at k {1,..., n}: where x j = (x, B) µ k (x, B ) if j = k x j (x k + 1) b kj if b kj 0 x j (x 1 k + 1) b kj if b kj > 0 x 1 j and B is obtained from B by matrix mutation at k. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
4 Definitions Let F = Q(t 1,..., t n ). An A-seed Σ in F is a pair (a, B), where a = (a 1,..., a n ) consists of algebraically independent elements of F and B = (b ij ) is a skew-symmetrizable n n integer matrix. Mutation at k {1,..., n}: where a j = a 1 k a j ( (a, B) µ k (a, B ) a b ik i + ) a b ik i b ik >0 b ik <0 and B is obtained from B by matrix mutation at k. if j = k if j k M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
5 Seed Patterns T n : n-regular tree with edges labeled with 1,..., n so each vertex sees each label. A seed pattern S is a collection of seeds {Σ t } t Tn such that if t k t in T n, then Σ t = µ k (Σ t ). An A-seed pattern is finite type if it contains finitely many seeds. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
6 Motivation Theorem (Fomin Zelevinsky (2003)) An A-seed pattern S(a, B) is finite type if and only if B is mutation equivalent to a matrix whose Cartan companion is a finite type Cartan matrix. Further, there is a bijection between A-variables and almost positive roots (positive or negative simple) in the corresponding root system. Combinatorics of finite type A-seed patterns of classical type are encoded in tagged triangulations of certain marked surfaces (Fomin Shapiro Thurston (2008)). M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
7 Motivation Theorem (Fomin Zelevinsky (2003)) An A-seed pattern S(a, B) is finite type if and only if B is mutation equivalent to a matrix whose Cartan companion is a finite type Cartan matrix. Further, there is a bijection between A-variables and almost positive roots (positive or negative simple) in the corresponding root system. Combinatorics of finite type A-seed patterns of classical type are encoded in tagged triangulations of certain marked surfaces (Fomin Shapiro Thurston (2008)). Question Let S(x, B) be an X -seed pattern of classical type. What can we say about its combinatorics? M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
8 The Answer Theorem (S.B. (2018)) Let S be an X -seed pattern of classical type and let P be the corresponding marked surface. Then there is a bijection between the quadrilaterals (with a choice of diagonal) appearing in triangulations of P and the X -variables of S. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
9 The Answer Theorem (S.B. (2018)) Let S be an X -seed pattern of classical type and let P be the corresponding marked surface. Then there is a bijection between the quadrilaterals (with a choice of diagonal) appearing in triangulations of P and the X -variables of S. Classical types: Type A n B n, C n D n X (S) 2 ( ) n n(n + 1)(n ) 3 n(n 1)(n2 + 4n 6) Exceptional types: Type E 6 E 7 E 8 F 4 G 2 X (S) M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
10 A-seed patterns of classical types S a A-seed pattern of type A n (D n ), P an (n + 3)-gon (punctured n-gon). {A-variables of S} {arcs of tagged triangulations of P} {seeds Σ in S} {triangulations T of P}. If Σ corresponds to T, the A-variables of Σ correspond to the arcs of T and the exchange matrix of Σ can be obtained from T. Mutating Σ at k corresponds to flipping the k th arc in T. There is an analogous story for types B n, C n involving triangulations preserved by a particular group action. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
11 A surjection... Let S be an X -seed pattern of classical type, and P be the appropriate marked surface. Think of seeds (x, B) as triangulations T of P with arcs labeled by X -variables (B is the signed adjacency matrix of T ). Mutating/flipping an arc γ may change the labels of the arcs adjacent to γ. If we mutate away from the quadrilateral of an arc γ, the label of γ does not change. x j = if j = k x j (x k + 1) b kj if b kj 0 x j (x 1 k + 1) b kj if b kj > 0 x 1 j M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
12 A surjection... Let S be an X -seed pattern of classical type, and P be the appropriate marked surface. Think of seeds (x, B) as triangulations T of P with arcs labeled by X -variables (B is the signed adjacency matrix of T ). Mutating/flipping an arc γ may change the labels of the arcs adjacent to γ. If we mutate away from the quadrilateral of an arc γ, the label of γ does not change. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
13 A surjection... Fact (Fomin Shapiro Thurston (2008)) Let T, T be two tagged triangulations of a marked surface which both contain arcs τ 1,..., τ s. Then T can be obtained from T by a sequence of arc flips avoiding τ 1,..., τ s. So α : {q {γ} q a quadrilateral with diagonal γ in P} X (S) is well-defined and surjective. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
14 ...which is injective. Proposition The X -variables associated to distinct quadrilaterals are distinct. Method of proof: Consider a particular A-seed pattern R of each type (can be found in e.g. Intro. to cluster algebras); A-variables are rational functions on a vector space V. Look at a related X -seed pattern ˆR; X -variables are rational functions of A-variables in R. For any pair of X -variables labeling diagonals of different quadrilaterals, verify that they are different functions on V. M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
15 Corollaries and a Conjecture Type A n B n, C n D n X 2 ( ) n n(n + 1)(n ) 3 n(n 1)(n2 + 4n 6) X pc n(n + 1) 2n 2 2n(n 1) Type E 6 E 7 E 8 F 4 G 2 X X pc Note: X pc is the number of X -variables when we replace + with tropical plus in the X -variable mutation formulas. The values follow from results of (Speyer Thomas (2013)). M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
16 Corollaries and a Conjecture Corollary Let S be an X -seed pattern of type Z n. The X -variables in S are in bijection with ordered pairs of exchangeable A-variables in an A-seed pattern of type Z n. The X -variables in S are in bijection with ordered pairs of almost-positive roots with compatibility degree 1 in the root system of type Z n. Conjecture Let T be a tagged triangulation of a marked surface (S, M), B the signed adjacency matrix of T, and S := S(x, B). Then the following map is a bijection: α : {q {γ} q a quadrilateral with diagonal γ in (S, M)} X (S). M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
17 References V. Fock, A. Goncharov, Cluster ensembles, quantization and the dilogarithm, Ann. Sci. Éc. Norm. Supér. (4) 42 (2009) S. Fomin, M. Shapiro, D. Thurston, Cluster algebras and triangulated surfaces. I. Cluster complexes, Acta Math. 201 (1) (2008) S. Fomin, A. Zelevinsky, Cluster algebras II. Finite type classification, Invent. Math. 154 (1) (2003) J. Golden, A. Goncharov, M. Spradlin, C. Vergu, A. Volovich, Motivic amplitudes and cluster coordinates, Journal of High Energy Physics 2014 (1). M. Gross, P. Hacking, S. Keel, M. Kontsevich, Canonical bases for cluster algebras, J. Amer. Math. Soc. 31 (2) (2018) D. Speyer, H. Thomas, Acyclic cluster algebras revisited, in: Algebras, quivers and representations, Vol. 8 of Abel Symp., Springer, Heidelberf, 2013, M. Sherman-Bennett (UC Berkeley) X -variables in finite type AMS Fall Sectionals / 12
Combinatorics 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 informationINTRODUCTION 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 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 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 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 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 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 informationGraph Theoretical Cluster Expansion Formulas
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 Outline.
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 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 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 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 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 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 informationarxiv: v1 [math.co] 11 Dec 2014
MAXIMAL GREEN SEQUENCES FOR CLUSTER ALGEBRAS ASSOCIATED TO THE n-torus ERIC BUCHER arxiv:141.3713v1 [math.co] 11 Dec 014 Abstract. Given amarkedsurace(s,m) wecanaddarcstothe suracetocreateatriangulation,
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 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 informationPolyhedral Combinatorics of Coxeter Groups 2
3 s 2 s 6 s 4 s 5 s 1 s 3 s 2 s 6 s 4 s 5 s 1 s 3 s Polyhedral Combinatorics of Coxeter Groups 2 s 6 s 5 s 1 s Dissertation s Defense 3 s 2 s 6 Jean-Philippe Labbé s 1 s s 2 s 1 α u ut(α s ) u(α t ) ut(α
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 informationVeering triangulations admit strict angle structures
Veering triangulations admit strict angle structures Craig Hodgson University of Melbourne Joint work with Hyam Rubinstein, Henry Segerman and Stephan Tillmann. Geometric Triangulations We want to understand
More informationCombinatorial underpinnings of Grassmannian cluster algebras SAGE Days June 2015 David E Speyer
Combinatorial underpinnings of Grassmannian cluster algebras SAGE Days June 2015 David E Speyer 128 123 127 178 137 134 234 136 135 167 145 678 156 345 567 456 Some of the most beautiful and important
More informationGraph Algorithms. Chromatic Polynomials. Graph Algorithms
Graph Algorithms Chromatic Polynomials Graph Algorithms Chromatic Polynomials Definition G a simple labelled graph with n vertices and m edges. k a positive integer. P G (k) number of different ways of
More informationCombinatorics of cluster structures in Schubert varieties
Séminaire Lotharingien de Combinatoire XX (2019) Article #YY, 12 pp. Proceedings of the 31 st Conference on Formal Power Series and Algebraic Combinatorics (Ljubljana) Combinatorics of cluster structures
More informationModuli spaces of convex projective structures on surfaces
arxiv:math/0405348v2 [math.dg] 27 Apr 2006 Moduli spaces of convex projective structures on surfaces Contents V.V. Fock, A. B. Goncharov To the memory of Yan Kogan 1 Introduction 1 2 Convex projective
More informationNoncrossing sets and a Graßmann associahedron
Noncrossing sets and a Graßmann associahedron Francisco Santos, Christian Stump, Volkmar Welker (in partial rediscovering work of T. K. Petersen, P. Pylyavskyy, and D. E. Speyer, 2008) (in partial rediscovering
More informationRoot Systems and Generalized Associahedra. Sergey Fomin and Nathan Reading
Root Systems and Generalized Associahedra Sergey Fomin and Nathan Reading IAS/Park City Mathematics Series Volume 14, 2004 Root Systems and Generalized Associahedra Sergey Fomin and Nathan Reading These
More informationColoring. Radhika Gupta. Problem 1. What is the chromatic number of the arc graph of a polygonal disc of N sides?
Coloring Radhika Gupta 1 Coloring of A N Let A N be the arc graph of a polygonal disc with N sides, N > 4 Problem 1 What is the chromatic number of the arc graph of a polygonal disc of N sides? Or we would
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 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 informationGraceful Labeling for Cycle of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 6, Number (014), pp. 173 178 International Research Publication House http://www.irphouse.com Graceful Labeling for Cycle of Graphs
More informationCatalan numbers. 2. In how many ways can you place 3 pairs of parentheses in the expression
Catalan numbers 1. In how many ways can you cut up a regular hexagon (6-sided polygon) into triangles using 3 nonintersecting diagonals? For example, there are 5 ways for a pentagon: 2. In how many ways
More informationCUBICAL SIMPLICIAL VOLUME OF SURFACES
CUBICAL SIMPLICIAL VOLUME OF SURFACES CLARA LÖH AND CHRISTIAN PLANKL ABSTRACT. Cubical simplicial volume is a variation on simplicial volume, based on cubes instead of simplices. Both invariants are homotopy
More informationGood Will Hunting s Problem: Counting Homeomorphically Irreducible Trees
Good Will Hunting s Problem: Counting Homeomorphically Irreducible Trees Ira M. Gessel Department of Mathematics Brandeis University Brandeis University Combinatorics Seminar September 18, 2018 Good Will
More informationarxiv: v2 [math.mg] 3 Sep 2013
MANY NON-EQUIVALENT REALIZATIONS OF THE ASSOCIAHEDRON CESAR CEBALLOS, FRANCISCO SANTOS, AND GÜNTER M. ZIEGLER arxiv:1109.5544v2 [math.mg] 3 Sep 2013 Abstract. Hohlweg and Lange (2007) and Santos (2004,
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 informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
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 information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationOptimal Region for Binary Search Tree, Rotation and Polytope
Optimal Region for Binary Search Tree, Rotation and Polytope Kensuke Onishi Mamoru Hoshi 2 Department of Mathematical Sciences, School of Science Tokai University, 7 Kitakaname, Hiratsuka, Kanagawa, 259-292,
More informationBasic Properties The Definition of Catalan Numbers
1 Basic Properties 1.1. The Definition of Catalan Numbers There are many equivalent ways to define Catalan numbers. In fact, the main focus of this monograph is the myriad combinatorial interpretations
More informationModuli spaces in genus zero and inversion of power series
Moduli spaces in genus zero and inversion of power series Curtis T. McMullen 1 October 2012 Let M 0,n denote the moduli space Riemann surfaces of genus 0 with n ordered marked points. Its Deligne-Mumford
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 informationCombinatorial Enumeration of Partitions of a Convex Polygon
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 2015, Article 15.9.4 Combinatorial Enumeration of Partitions of a Convex Polygon Dong Zhang and Dongyi Wei Peking University Beijing 100871 P. R.
More informationFURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION
FURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION HAILONG DAO AND JAY SCHWEIG Abstract. We study the relationship between the projective dimension of a squarefree monomial ideal
More informationInterval-Vector Polytopes
Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract
More informationMATH 139 W12 Review 1 Checklist 1. Exam Checklist. 1. Introduction to Predicates and Quantified Statements (chapters ).
MATH 139 W12 Review 1 Checklist 1 Exam Checklist 1. Introduction to Predicates and Quantified Statements (chapters 3.1-3.4). universal and existential statements truth set negations of universal and existential
More informationConway Coxeter friezes and mutation: a survey
Conway Coxeter friezes and mutation: a survey Karin Baur, Eleonore Faber, Sira Gratz, Khrystyna Serhiyenko, and Gordana Todorov Abstract In this survey article we explain the intricate links between Conway-Coxeter
More informationAn edge colouring of multigraphs
Computer Science Journal of Moldova, vol.15, no.(44), 007 An edge colouring of multigraphs Mario Gionfriddo, Alberto Amato Abstract We consider a strict k-colouring of a multigraph G as a surjection f
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 informationarxiv: v1 [math.gt] 18 Nov 2015
arxiv:1511.05845v1 [math.gt] 18 Nov 2015 A geometric description of the extreme Khovanov cohomology J. González-Meneses, P. M. G. Manchón and M. Silvero November 19, 2015 Abstract We prove that the hypothetical
More informationFLIP GRAPHS, YOKE GRAPHS AND DIAMETER
FLIP GRAPHS, AND Roy H. Jennings Bar-Ilan University, Israel 9th Sèminaire Lotharingien de Combinatoire 0- September, 0 Bertinoro, Italy FLIP GRAPHS, AND FLIP GRAPH TRIANGULATIONS PERMUTATIONS TREES KNOWN
More informationRealizations of the Associahedron and Cyclohedron
Discrete Comput Geom 37:57 543 (007) DOI: 0.007/s00454-007-39-6 Discrete & Computational Geometry 007 Springer Science+Business Media, Inc. Realizations of the Associahedron and Cyclohedron Christophe
More information274 Curves on Surfaces, Lecture 5
274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,
More informationarxiv: v1 [math.co] 20 Aug 2012
ENUMERATING TRIANGULATIONS BY PARALLEL DIAGONALS Alon Regev Department of Mathematical Sciences, Northern Illinois University, DeKalb, Illinois regev@math.niu.edu arxiv:108.91v1 [math.co] 0 Aug 01 1 Introduction
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 informationA NOTE ON MORPHISMS DETERMINED BY OBJECTS
A NOTE ON MORPHISMS DETERMINED BY OBJECTS XIAO-WU CHEN, JUE LE Abstract. We prove that a Hom-finite additive category having determined morphisms on both sides is a dualizing variety. This complements
More informationOn the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments
Electronic Journal of Graph Theory and Applications 3 (2) (2015), 191 196 On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Rafael Del Valle
More informationarxiv: v1 [math.gn] 22 Jun 2015
A Borsuk-Ulam theorem for digital images arxiv:1506.06426v1 [math.gn] 22 Jun 2015 P. Christopher Staecker February 25, 2018 Abstract The Borsuk-Ulam theorem states that a continuous function f : S n R
More information2009 HMMT Team Round. Writing proofs. Misha Lavrov. ARML Practice 3/2/2014
Writing proofs Misha Lavrov ARML Practice 3/2/2014 Warm-up / Review 1 (From my research) If x n = 2 1 x n 1 for n 2, solve for x n in terms of x 1. (For a more concrete problem, set x 1 = 2.) 2 (From this
More informationThe space of tropically collinear points is shellable
Collect. Math. 60, (2009), 63 77 c 2009 Universitat de Barcelona The space of tropically collinear points is shellable Hannah Markwig University of Michigan, Department of Mathematics, 2074 East Hall 530
More informationPerfect Matchings in Claw-free Cubic Graphs
Perfect Matchings in Claw-free Cubic Graphs Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea sangil@kaist.edu Submitted: Nov 9, 2009; Accepted: Mar 7, 2011; Published:
More informationh-polynomials of triangulations of flow polytopes (Cornell University)
h-polynomials of triangulations of flow polytopes Karola Mészáros (Cornell University) h-polynomials of triangulations of flow polytopes (and of reduction trees) Karola Mészáros (Cornell University) Plan
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics SOME BOAS-BELLMAN TYPE INEQUALITIES IN -INNER PRODUCT SPACES S.S. DRAGOMIR, Y.J. CHO, S.S. KIM, AND A. SOFO School of Computer Science and Mathematics
More informationarxiv: v1 [math.co] 4 Sep 2017
Abstract Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces andacertain
More informationSteep tilings and sequences of interlaced partitions
Steep tilings and sequences of interlaced partitions Jérémie Bouttier Joint work with Guillaume Chapuy and Sylvie Corteel arxiv:1407.0665 Institut de Physique Théorique, CEA Saclay Département de mathématiques
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 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 informationAdjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.
1 Graph Basics What is a graph? Graph: a graph G consists of a set of vertices, denoted V (G), a set of edges, denoted E(G), and a relation called incidence so that each edge is incident with either one
More informationarxiv:math/ v1 [math.at] 18 Oct 2005
arxiv:math/0510380v1 [math.at] 18 Oct 2005 PARKING FUNCTIONS AND TRIANGULATION OF THE ASSOCIAHEDRON JEAN-LOUIS LODAY Abstract. We show that a minimal triangulation of the associahedron (Stasheff polytope)
More informationMore on Permutation Labeling of Graphs
International Journal of Applied Graph Theory Vol.1, No. (017), 30-4. ISSN(Online) : 456 7884 More on Permutation Labeling of Graphs G. V. Ghodasara Department of Mathematics H. & H. B. Kotak Institute
More informationOn Universal Cycles of Labeled Graphs
On Universal Cycles of Labeled Graphs Greg Brockman Harvard University Cambridge, MA 02138 United States brockman@hcs.harvard.edu Bill Kay University of South Carolina Columbia, SC 29208 United States
More informationA Relational View of Subgraph Isomorphism
A Relational View of Subgraph Isomorphism J. Cortadella and G. Valiente Department of Software, Technical University of Catalonia, Barcelona, Spain Abstract. This paper presents a novel approach to the
More informationChapter 4. Triangular Sum Labeling
Chapter 4 Triangular Sum Labeling 32 Chapter 4. Triangular Sum Graphs 33 4.1 Introduction This chapter is focused on triangular sum labeling of graphs. As every graph is not a triangular sum graph it is
More informationCOLOURINGS OF m-edge-coloured GRAPHS AND SWITCHING
COLOURINGS OF m-edge-coloured GRAPHS AND SWITCHING GARY MACGILLIVRAY AND J. MARIA WARREN Abstract. Graphs with m disjoint edge sets are considered, both in the presence of a switching operation and without
More informationMath Introduction to Advanced Mathematics
Math 215 - Introduction to Advanced Mathematics Number Theory Fall 2017 The following introductory guide to number theory is borrowed from Drew Shulman and is used in a couple of other Math 215 classes.
More informationCombinatorial Tilings of the Sphere by Pentagons
Combinatorial Tilings of the Sphere by Pentagons Min Yan Department of Mathematics Hong Kong University of Science and Technology Kowloon, Hong Kong mamyan@ust.hk Submitted: Nov 16, 2012; Accepted: Mar
More informationThe Edge Slide Graph of the 3-cube
Rose-Hulman Undergraduate Mathematics Journal Volume 12 Issue 2 Article 6 The Edge Slide Graph of the 3-cube Lyndal Henden Massey University, Palmerston North, New Zealand, lyndal_henden@hotmail.com Follow
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationCannon s conjecture, subdivision rules, and expansion complexes
Cannon s conjecture, subdivision rules, and expansion complexes W. Floyd (joint work with J. Cannon and W. Parry) Department of Mathematics Virginia Tech UNC Greensboro: November, 2014 Motivation from
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 informationProfessor: Padraic Bartlett. Lecture 9: Trees and Art Galleries. Week 10 UCSB 2015
Math 7H Professor: Padraic Bartlett Lecture 9: Trees and Art Galleries Week 10 UCSB 2015 1 Prelude: Graph Theory This talk uses the mathematical concepts of graphs from our previous class. In particular,
More informationHow to construct new super edge-magic graphs from some old ones
How to construct new super edge-magic graphs from some old ones E.T. Baskoro 1, I W. Sudarsana 2 and Y.M. Cholily 1 1 Department of Mathematics Institut Teknologi Bandung (ITB), Jalan Ganesa 10 Bandung
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 informationMATRIX INTEGRALS AND MAP ENUMERATION 1
MATRIX INTEGRALS AND MAP ENUMERATION 1 IVAN CORWIN Abstract. We explore the connection between integration with respect to the GUE and enumeration of maps. This connection is faciliated by the Wick Formula.
More informationT. Background material: Topology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 T. Background material: Topology For convenience this is an overview of basic topological ideas which will be used in the course. This material
More informationpα i + q, where (n, m, p and q depend on i). 6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD
6. GROMOV S INVARIANT AND THE VOLUME OF A HYPERBOLIC MANIFOLD of π 1 (M 2 )onπ 1 (M 4 ) by conjugation. π 1 (M 4 ) has a trivial center, so in other words the action of π 1 (M 4 ) on itself is effective.
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 informationA non-partitionable Cohen-Macaulay simplicial complex, and implications for Stanley depth
A non-partitionable Cohen-Macaulay simplicial complex, and implications for Stanley depth Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University
More informationON THE GENUS OF THE COMPOSITION OF TWO GRAPHS
PACIFIC JOURNAL OF MATHEMATICS Vol. 41, No. 1, 1972 ON THE GENUS OF THE COMPOSITION OF TWO GRAPHS ARTHUR T. WHITE Given two graphs G and H, a new graph G(H), called the composition (or lexicographic product)
More informationNOTE. Intransitive Trees
journal of combinatorial theory, Series A 79, 360366 (1997) article no. TA962735 NOTE Intransitive Trees Alexander Postnikov* Department of Mathematics, Massachusetts Institute of Technology, Cambridge,
More informationDistortion Varieties. Joe Kileel UC Berkeley. AMS NCSU November 12, 2016
Distortion Varieties Joe Kileel UC Berkeley AMS Sectional @ NCSU November 12, 2016 Preprint Distortion Varieties, J. Kileel, Z. Kukelova, T. Pajdla, B. Sturmfels arxiv:1610.01860 Preprint Distortion Varieties,
More informationOn Jeśmanowicz Conjecture Concerning Pythagorean Triples
Journal of Mathematical Research with Applications Mar., 2015, Vol. 35, No. 2, pp. 143 148 DOI:10.3770/j.issn:2095-2651.2015.02.004 Http://jmre.dlut.edu.cn On Jeśmanowicz Conjecture Concerning Pythagorean
More informationTriangulations of hyperbolic 3-manifolds admitting strict angle structures
Triangulations of hyperbolic 3-manifolds admitting strict angle structures Craig D. Hodgson, J. Hyam Rubinstein and Henry Segerman segerman@unimelb.edu.au University of Melbourne January 4 th 2012 Ideal
More informationGraceful Labeling for Some Star Related Graphs
International Mathematical Forum, Vol. 9, 2014, no. 26, 1289-1293 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.4477 Graceful Labeling for Some Star Related Graphs V. J. Kaneria, M.
More informationEuropean Journal of Combinatorics. Homotopy types of box complexes of chordal graphs
European Journal of Combinatorics 31 (2010) 861 866 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Homotopy types of box complexes
More informationDelaunay Triangulations
Delaunay Triangulations (slides mostly by Glenn Eguchi) Motivation: Terrains Set of data points A R 2 Height ƒ(p) defined at each point p in A How can we most naturally approximate height of points not
More information