The Tutte polynomial, its applications and generalizations. Sergei Chmutov The Ohio State University, Mansfield
|
|
- Magnus Holt
- 5 years ago
- Views:
Transcription
1 University of South Alabama The Tutte polynomial, its applications and generalizations Sergei Chmutov The Ohio State University, Mansfield Thursday, April 5, 00 :0 4:0 p.m.
2 Chromatic polynomial C Γ (q) := # of proper colorings of V (Γ) in q colors Example. C (q) = q(q )(q q + ) q = : Properties: C Γ = C Γe C Γ/e, C Γ Γ = C Γ C Γ, C = q. S := C Γ (q) = σ S { } V (Γ) {,..., q} (a,b) E(Γ) ( ) δ(σ(a), σ(b)) Dichromatic polynomial Z Γ (q, v) := ( + vδ(σ(a), σ(b))) σ S C Γ (q) = Z Γ (q, ). (a,b) E(Γ) Z Γ (q, v) = F E(Γ) q k(f) v e(f). Properties: Z Γ = Z Γe +vz Γ/e, Z Γ Γ = Z Γ Z Γ, Z = q.
3 Let Γ be a graph; The Tutte polynomial v(γ) be the number of its vertices; e(γ) be the number of its edges; k(γ) be the number of components of Γ; r(γ) := v(γ) k(γ) be the rank of Γ; n(γ) := e(γ) r(γ) be the nullity of Γ; T Γ (x, y) := Properties. F E(Γ) (x ) r(γ)r(f) (y ) n(f) Z Γ (q, v) = q k(γ) v r(γ) T Γ ( + qv, + v) T Γ = T Γe + T Γ/e if e is neither a bridge nor a loop ; T Γ = xt Γ/e if e is a bridge ; T Γ = yt Γe if e is a loop ; T Γ Γ = T Γ Γ = T Γ T Γ for a disjoint union, Γ Γ T =. and a one-point join, Γ Γ ; T Γ (, ) is the number of spanning trees of Γ ; T Γ (, ) is the number of spanning forests of Γ ; T Γ (, ) is the number of spanning connected subgraphs of Γ ; T Γ (, ) = E(Γ) is the number of spanning subgraphs of Γ.
4 The Potts model C.Domb (95). q = the Ising model; W.Lenz (90). Atoms are located at the sites of vertices V (Γ). Nearest neighbors are indicated by edges E(Γ). An atom exists in one of q different states (spins). A state, σ S, is an assignments of spins to all vertices V (Γ). Neighboring atoms interact with each other only is their spins are the same. The energy of the interaction is J (coupling constant). The model is called ferromagnetic if J > 0 and antiferromagnetic if J < 0. Energy of a state σ (Hamiltonian), H(σ) = J δ(σ(a), σ(b)). (a,b) E(Γ) Boltzmann weight of σ: e βh(σ) = e Jβδ(σ(a),σ(b)) = (a,b) E(Γ) (a,b) E(Γ) ( ) +(e Jβ )δ(σ(a), σ(b)), where the inverse temperature β = κ T, T is the temperature, κ =.8 0 joules/kelvin is the Boltzmann constant. The Potts partition function Z Potts Γ := σ S e βh(σ) = Z Γ (q, e Jβ ) unphysical region antiferromagnetic 0 ferromagnetic region v = e Jβ
5 Probability of a state σ: P(σ) := e βh(σ) /Z Γ. Expected value of a function f(σ): f := σ f(σ)p(σ) = σ f(σ)e βh(σ) /Z Γ. Expected energy: H = σ H(σ)e βh(σ) /Z Γ = d dβ lnz Γ. Example. Γ = } {{. } n vertices T Γ = x n, Z Γ = qv n ( + qv ) n = q(q + v) n = q(q + e βj ) n. Je βj Expected energy: H = (n ) q + e. βj Expected energy per atom as n : H lim n n = JeβJ q + e βj. T (β 0): The energy per atom J/q. T 0 (β ). J < 0 (antiferromagnetic): The energy per atom 0. In general, e βj 0 and the partition function Z Γ (q, ) = C Γ (q). J > 0 (ferromagnetic): The energy per atom J.
6 Morwen Thistlethwaite (987) Up to a sign and a power of t the Jones polynomial V L (t) of an alternating link L is equal to the Tutte polynomial T ΓL (t, t ). L Γ L V L (t) = t + t t 4 T ΓL (x, y) = y + x + x = t (t t + t ) T ΓL (t, t ) = t t + t
7 The Kauffman bracket Let L be a virtual link diagram. A-splitting A state S is a choice of either A- or B-splitting at every classical crossing. B-splitting α(s) = #(of A-splittings in S) β(s) = #(of B-splittings in S) δ(s) = #(of circles in S) [L](A, B, d) := S A α(s) B β(s) d δ(s) J L (t) := () w(l) t w(l)/4 [L](t /4, t /4, t / t / ) Example (α, β, δ) (, 0, ) (,, ) (,, ) (,, ) (,, ) (,, ) (,, ) (0,, ) [L] = A + A Bd + AB + AB d + B d ; J L (t) =
8 Graphs on surfaces Ribbon graphs A ribbon graph G is a surface represented as a union of verticesdiscs and edges-ribbons discs and ribbons intersect by disjoint line segments, each such line segment lies on the boundary of precisely one vertex and precisely one edge; every edge contains exactly two such line segments. + = +
9 The Bollobás-Riordan polynomial Let F be a ribbon graph; v(f) be the number of its vertices; e(f) be the number of its edges; k(f) be the number of components of F; r(f) := v(f) k(f) be the rank of F; n(f) := e(f) r(f) be the nullity of F; bc(f) be the number of boundary components of F; s(f) := e (F) e (F). R G (x, y, z) := x r(g)r(f)+s(f) y n(f)s(f) z k(f)bc(f)+n(f) F Relations to the Tutte polynomial. R G (x, y, ) = T G (x, y) If G is planar (genus zero): R G (x, y, z) = T G (x, y)
10 Example. + (k, r, n, bc, s) (,,,, ) (,, 0,, 0) (,, 0,, 0) (, 0, 0,, ) (,,,, ) (,,,, 0) (,,,, 0) (, 0,,, ) r(f) := v(f) k(f); n(f) := e(g) r(f); bc(f) is the number of boundary components; s(f) := e (F) e (F). R G (x, y, z) = x + + y + xyz + yz + y z.
11 Construction of a ribbon graph from a virtual link diagram L A B B Diagram State s + Attaching planar bands Replacing bands by arrows Untwisting state circles + ; ; Pulling state circles apart + Forming the ribbon graph G s L
12 Theorem Let L be a virtual link diagram with e classical crossings, G s L be the signed ribbon graph corresponding to a state s, and v := v(g s L ), k := k(gs L ). Then e = e(gs L ) and [L](A, B, d) = A (x e k y v z v+ R G s L (x, y, z) x= Ad B, y= Bd A, z= d ). Idea of the proof. One-to-one correspondence between states s of L and spanning subgraphs F of G s L : An edge e of G s L belongs to the spanning subgraph F if and only if the corresponding crossing was split in s differently comparably with s.
13 Iain Moffatt: Further developments Knot invariants and the Bollobás-Riordan polynomial of embedded graphs, European Journal of Combinatorics, 9 (008) arxiv:math/ Partial duality and Bollobás and Riordan s ribbon graph polynomial, Discrete Mathematics, 0 (00) arxiv: A characterization of partially dual graphs. arxiv: Fabien Vignes-Tourneret: The multivariate signed Bollobás-Riordan polynomial, Discrete Mathematics, 09 (009) arxiv: (joint with T. Krajewski, V. Rivasseau) Topological graph polynomials and quantum field theory, Part II: Mehler kernel theories. arxiv: (non-commutative Grosse- Wulkenhaar quantum field theory)
SERGEI CHMUTOV AND IGOR PAK
Dedicated to Askold Khovanskii on the occasion of his 60th birthday THE KAUFFMAN BRACKET OF VIRTUAL LINKS AND THE BOLLOBÁS-RIORDAN POLYNOMIAL SERGEI CHMUTOV AND IGOR PAK Abstract. We show that the Kauffman
More informationGRAPHS, LINKS, AND DUALITY ON SURFACES
GRAPHS, LINKS, AND DUALITY ON SURFACES VYACHESLAV KRUSHKAL Abstract. We introduce a polynomial invariant of graphs on surfaces, P G, generalizing the classical Tutte polynomial. Topological duality on
More informationKNOT INVARIANTS AND THE BOLLOBÁS-RIORDAN POLYNOMIAL OF EMBEDDED GRAPHS
KNOT INVARIANTS AND THE BOLLOBÁS-RIORDAN POLYNOMIAL OF EMBEDDED GRAPHS IAIN MOFFATT Abstract. For a graph G embedded in an orientable surface Σ, we consider associated links LG in the thickened surface
More informationTutte Polynomials with Applications
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 6 (26), pp. 4781 4797 Research India Publications http://www.ripublication.com/gjpam.htm Tutte Polynomials with Applications
More informationQuasi-Trees and Khovanov homology
Quasi-Trees and Khovanov homology Abhijit Champanerkar 1, Ilya Kofman, Neal Stoltzfus 3 1 U. South Alabama CUNY, Staten Island 3 Louisiana State University Virtual Topology Seminar: LSU & Iowa Outline
More informationOn the study of the Potts model, Tutte and Chromatic Polynomials, and the Connections with Computation Complexity and Quantum Computing.
On the study of the Potts model, Tutte and Chromatic Polynomials, and the Connections with Computation Complexity and Quantum Computing Marina von Steinkirch Institute of Physics and Astronomy, State University
More informationFrom Potts to Tutte and back again... A graph theoretical view of statistical mechanics
From Potts to Tutte and back again... A graph theoretical view of statistical mechanics Jo Ellis-Monaghan e-mail: jellis-monaghan@smcvt.edu website: http://academics.smcvt.edu/jellis-monaghan 10/27/05
More informationRELATIVE TUTTE POLYNOMIALS FOR COLORED GRAPHS AND VIRTUAL KNOT THEORY. 1. Introduction
RELATIVE TUTTE POLYNOMIALS FOR COLORED GRAPHS AND VIRTUAL KNOT THEORY Y. DIAO AND G. HETYEI Abstract. We introduce the concept of a relative Tutte polynomial. We show that the relative Tutte polynomial
More informationA survey of Tutte-Whitney polynomials
A survey of Tutte-Whitney polynomials Graham Farr Faculty of IT Monash University Graham.Farr@infotech.monash.edu.au July 2007 Counting colourings proper colourings Counting colourings proper colourings
More informationSeungwon Kim and Ilya Kofman. Turaev Surfaces
Seungwon Kim and Ilya Kofman Turaev Surfaces Chapter 1 Turaev Surfaces 1.1 Introduction The two most famous knot invariants, the Alexander polynomial (1923) and the Jones polynomial (1984), mark paradigm
More informationThe Structure of the Tutte-Grothendieck Ring of Ribbon Graphs
Rose-Hulman Undergraduate Mathematics Journal Volume 13 Issue 2 Article 2 The Structure of the Tutte-Grothendieck Ring of Ribbon Graphs Daniel C. Thompson MIT, dthomp@math.mit.edu Follow this and additional
More informationMinors and Tutte invariants for alternating dimaps
Minors and Tutte invariants for alternating dimaps Graham Farr Clayton School of IT Monash University Graham.Farr@monash.edu Work done partly at: Isaac Newton Institute for Mathematical Sciences (Combinatorics
More informationQuantum Information, the Jones Polynomial and Khovanov Homology Louis H. Kauffman Math, UIC 851 South Morgan St. Chicago, IL 60607-7045 www.math.uic.edu/~kauffman http://front.math.ucdavis.edu/author/l.kauffman
More informationAntiferromagnetic 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 informationThe Three-Variable Bracket Polynomial for Reduced, Alternating Links
Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 2 Article 7 The Three-Variable Bracket Polynomial for Reduced, Alternating Links Kelsey Lafferty Wheaton College, Wheaton, IL, kelsey.lafferty@my.wheaton.edu
More informationStatistical Mechanics and Combinatorics : Lecture I
Statistical Mechanics and Combinatorics : Lecture I 1 Overview We are considering interactions between three fields of mathematics: combinatorics, statistics and probability In short, combinatorics is
More informationInvariants of Turaev genus one links
Invariants of Turaev genus one links Adam Lowrance - Vassar College Oliver Dasbach - Louisiana State University March 9, 2017 Philosophy 1 Start with a family of links F and a link invariant Inv(L). 2
More informationRenormalizability in (noncommutative) field theories
Renormalizability in (noncommutative) field theories LIPN in collaboration with: A. de Goursac, R. Gurău, T. Krajewski, D. Kreimer, J. Magnen, V. Rivasseau, F. Vignes-Tourneret, P. Vitale, J.-C. Wallet,
More informationALTERNATING KNOT DIAGRAMS, EULER CIRCUITS AND THE INTERLACE POLYNOMIAL
ALTERNATING KNOT DIAGRAMS, EULER CIRCUITS AND THE INTERLACE POLYNOMIAL P. N. BALISTER, B. BOLLOBÁS, O. M. RIORDAN AND A. D. SCOTT Abstract. We show that two classical theorems in graph theory and a simple
More informationThe Chromatic Symmetric Function: Hypergraphs and Beyond
The : Hypergraphs and Beyond arxiv:6.0969 Department of Mathematics Michigan State University Graduate Student Combinatorics Conference, April 07 Outline Introducing the chromatic symmetric function Definition
More informationKai Sun. University of Michigan, Ann Arbor. Collaborators: Krishna Kumar and Eduardo Fradkin (UIUC)
Kai Sun University of Michigan, Ann Arbor Collaborators: Krishna Kumar and Eduardo Fradkin (UIUC) Outline How to construct a discretized Chern-Simons gauge theory A necessary and sufficient condition for
More informationTemperley Lieb Algebra I
Temperley Lieb Algebra I Uwe Kaiser Boise State University REU Lecture series on Topological Quantum Computing, Talk 3 June 9, 2011 Kauffman bracket Given an oriented link diagram K we define K Z[A, B,
More informationSergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada. and
NON-PLANAR EXTENSIONS OF SUBDIVISIONS OF PLANAR GRAPHS Sergey Norin Department of Mathematics and Statistics McGill University Montreal, Quebec H3A 2K6, Canada and Robin Thomas 1 School of Mathematics
More informationKnight move in chromatic cohomology
Knight move in chromatic cohomology arxiv:math/0511598v2 [math.co] 5 Sep 2006 Michael Chmutov Department of Mathematics, The Ohio State University, 231 W. 18th Avenue, Columbus, Ohio 43210 chmutov@mps.ohio-state.edu
More informationThe near-critical planar Ising Random Cluster model
The near-critical planar Ising Random Cluster model Gábor Pete http://www.math.bme.hu/ gabor Joint work with and Hugo Duminil-Copin (Université de Genève) Christophe Garban (ENS Lyon, CNRS) arxiv:1111.0144
More informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
More informationApplications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Regarding Hypergraphs Ph.D. Dissertation Defense April 15, 2013 Overview The Local Lemmata 2-Coloring Hypergraphs with the Original Local Lemma Counting Derangements with the Lopsided Local Lemma Lopsided
More informationUNIQUENESS OF HIGHLY REPRESENTATIVE SURFACE EMBEDDINGS
UNIQUENESS OF HIGHLY REPRESENTATIVE SURFACE EMBEDDINGS P. D. Seymour Bellcore 445 South St. Morristown, New Jersey 07960, USA and Robin Thomas 1 School of Mathematics Georgia Institute of Technology Atlanta,
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 informationCombinatorial and physical content of Kirchhoff polynomials
Combinatorial and physical content of Kirchhoff polynomials Karen Yeats May 19, 2009 Spanning trees Let G be a connected graph, potentially with multiple edges and loops in the sense of a graph theorist.
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationThe spread and extreme terms of Jones polynomials
arxiv:math/0012089v2 [math.gt] 10 Oct 2001 The spread and extreme terms of Jones polynomials Yongju Bae and H.R.Morton February 1, 2008 Abstract We adapt Thistlethwaite s alternating tangle decomposition
More informationA multivariate interlace polynomial
A multivariate interlace polynomial Bruno Courcelle LaBRI, Université Bordeaux 1 and CNRS General objectives : Logical descriptions of graph polynomials Application to their computations Systematic construction
More informationarxiv: v2 [math.gt] 27 Mar 2009
ODD KHOVANOV HOMOLOGY IS MUTATION INVARIANT JONATHAN M. BLOOM arxiv:0903.3746v2 [math.gt] 27 Mar 2009 Abstract. We define a link homology theory that is readily seen to be both isomorphic to reduced odd
More informationPolynomials in graph theory
Polynomials in graph theory Alexey Bogatov Department of Software Engineering Faculty of Mathematics and Mechanics Saint Petersburg State University JASS 2007 Saint Petersburg Course 1: Polynomials: Their
More informationTopological graph polynomials and quantum field theory, Part II: Mehler kernel theories
Topological graph polynomials and quantum field theory, Part II: Mehler kernel theories T. Krajewski, Vincent Rivasseau, Fabien Vignes-Tourneret To cite this version: T. Krajewski, Vincent Rivasseau, Fabien
More informationIndependent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs
Journal of Combinatorial Theory, Series B 72, 104109 (1998) Article No. TB971794 Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs Carsten Thomassen Department of Mathematics,
More informationCographs; chordal graphs and tree decompositions
Cographs; chordal graphs and tree decompositions Zdeněk Dvořák September 14, 2015 Let us now proceed with some more interesting graph classes closed on induced subgraphs. 1 Cographs The class of cographs
More informationMARTIN LOEBL AND JEAN-SEBASTIEN SERENI
POTTS PARTITION FUNCTION AND ISOMORPHISMS OF TREES MARTIN LOEBL AND JEAN-SEBASTIEN SERENI Abstract. We explore the well-known Stanley conjecture stating that the symmetric chromatic polynomial distinguishes
More informationCHERN-SIMONS THEORY AND LINK INVARIANTS! Dung Nguyen! U of Chicago!
CHERN-SIMONS THEORY AND LINK INVARIANTS! Dung Nguyen! U of Chicago! Content! Introduction to Knot, Link and Jones Polynomial! Surgery theory! Axioms of Topological Quantum Field Theory! Wilson loopsʼ expectation
More informationSiegel s theorem, edge coloring, and a holant dichotomy
Siegel s theorem, edge coloring, and a holant dichotomy Tyson Williams (University of Wisconsin-Madison) Joint with: Jin-Yi Cai and Heng Guo (University of Wisconsin-Madison) Appeared at FOCS 2014 1 /
More informationTranslation-invariant renormalizable models. the Moyal space
on the Moyal space ADRIAN TANASĂ École Polytechnique, Palaiseau, France 0802.0791 [math-ph], Commun. Math. Phys. (in press) (in collaboration with R. Gurău, J. Magnen and V. Rivasseau) 0806.3886 [math-ph],
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationParameterized Domination in Circle Graphs
Parameterized Domination in Circle Graphs Nicolas Bousquet 1, Daniel Gonçalves 1, George B. Mertzios 2, Christophe Paul 1, Ignasi Sau 1, and Stéphan Thomassé 3 1 AlGCo project-team, CNRS, LIRMM, Montpellier,
More informationOn colorability of graphs with forbidden minors along paths and circuits
On colorability of graphs with forbidden minors along paths and circuits Elad Horev horevel@cs.bgu.ac.il Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva 84105, Israel Abstract.
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationOn Powers of some Intersection Graphs
On Powers of some Intersection Graphs Geir Agnarsson Abstract We first consider m-trapezoid graphs and circular m-trapezoid graphs and give new constructive proofs that both these classes are closed under
More informationThe Complexity of Computing the Sign of the Tutte Polynomial
The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint work with Mark Jerrum) Oxford Algorithms Workshop, October 2012 The Tutte polynomial of a graph G = (V,
More informationNON-TRIVIALITY OF GENERALIZED ALTERNATING KNOTS
Journal of Knot Theory and Its Ramifications c World Scientific Publishing Company NON-TRIVIALITY OF GENERALIZED ALTERNATING KNOTS MAKOTO OZAWA Natural Science Faculty, Faculty of Letters, Komazawa University,
More informationarxiv: v2 [math.co] 18 Dec 2007
TUTTE CHROMATIC IDENTITIES FROM THE TEMPERLEY-LIEB ALGEBRA arxiv:0711.0016v2 [math.co] 18 Dec 2007 PAUL FENDLEY 1 AND VYACHESLAV KRUSHKAL 2 Abstract. One remarkable feature of the chromatic polynomial
More informationPotts Model and Generalizations: Exact Results and Statistical Physics
Potts Model and Generalizations: Exact Results and Statistical Physics A Dissertation Presented by Yan Xu to The Graduate School in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationA Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
Combinatorics, Probability and Computing (1994) 3, 273-283 Copyright 1994 Cambridge University Press A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs J. D. ANNANt
More informationThe Relative Topological Complexity of Pairs of Right-Angled Artin Groups
The Relative Topological Complexity of Pairs of Right-Angled Artin Groups Robert Short Lehigh University February 28, 2018 Robert Short (Lehigh University) Rel TC of RAAGs CUNY Grad Center February 28,
More informationVirtual Tribrackets. Sam Nelson Shane Pico
Virtual Tribrackets Sam Nelson Shane Pico arxiv:1803.03210v2 [math.gt] 6 Dec 2018 Abstract We introduce virtual tribrackets, an algebraic structure for coloring regions in the planar complement of an oriented
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationNowhere zero flow. Definition: A flow on a graph G = (V, E) is a pair (D, f) such that. 1. D is an orientation of G. 2. f is a function on E.
Nowhere zero flow Definition: A flow on a graph G = (V, E) is a pair (D, f) such that 1. D is an orientation of G. 2. f is a function on E. 3. u N + D (v) f(uv) = w ND f(vw) for every (v) v V. Example:
More informationJONES POLYNOMIALS AND CLASSICAL CONJECTURES IN KNOT THEORY
Topology Vol. 26. No. 1. pp. 187-194. I987 Pruned in Great Bmain. oo40-9383,87 53.00 + al c 1987 Pcrgamon Journals Ltd. JONES POLYNOMIALS AND CLASSICAL CONJECTURES IN KNOT THEORY K UNIO M URASUGI (Received
More informationA POLYNOMIAL INVARIANT OF GRAPHS ON ORIENTABLE SURFACES
A POLYNOMIAL INVARIANT OF GRAPHS ON ORIENTABLE SURFACES BEÂ LA BOLLOBAÂ S and OLIVER RIORDAN [Received 22 September 999; revised 6 November 2000]. Introduction Our aim in this paper is to construct a polynomial
More informationON BIALGEBRAS AND HOPF ALGEBRAS OF ORIENTED GRAPHS
Confluentes Mathematici, Vol. 4, No. 1 (2012) 1240003 (10 pages) c World Scientific Publishing Company DOI: 10.1142/S1793744212400038 ON BIALGEBRAS AND HOPF ALGEBRAS OF ORIENTED GRAPHS DOMINIQUE MANCHON
More informationARTICLE IN PRESS Discrete Mathematics ( )
Discrete Mathematics ( ) Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc On the interlace polynomials of forests C. Anderson a, J. Cutler b,,
More informationTUTTE AND JONES POLYNOMIALS OF LINK FAMILIES
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Filomat 24:3 (2010), 19 33 DOI: 10.2298/FIL1003019J TUTTE AND JONES POLYNOMIALS OF LINK FAMILIES
More informationBranchwidth of graphic matroids.
Branchwidth of graphic matroids. Frédéric Mazoit and Stéphan Thomassé Abstract Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationGeometric Estimates from spanning surfaces of knots
Geometric Estimates from spanning surfaces of knots joint w/ Stephan Burton (MSU) Michigan State University Knots in Hellas, Olymbia, Greece, July 18, 2016 Burton-Kalfagianni (MSU) J 1 / 20 Knot complement:
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationEvery line graph of a 4-edge-connected graph is Z 3 -connected
European Journal of Combinatorics 0 (2009) 595 601 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Every line graph of a 4-edge-connected
More informationOn the Path-width of Planar Graphs
On the Path-width of Planar Graphs Omid Amini 1,2 Florian Huc 1 Stéphane Pérennes 1 FirstName.LastName@sophia.inria.fr Abstract In this paper, we present a result concerning the relation between the path-with
More informationTopological order from quantum loops and nets
Topological order from quantum loops and nets Paul Fendley It has proved to be quite tricky to T -invariant spin models whose quasiparticles are non-abelian anyons. 1 Here I ll describe the simplest (so
More informationRealizing non-abelian statistics in quantum loop models
Realizing non-abelian statistics in quantum loop models Paul Fendley Experimental and theoretical successes have made us take a close look at quantum physics in two spatial dimensions. We have now found
More informationCombining the cycle index and the Tutte polynomial?
Combining the cycle index and the Tutte polynomial? Peter J. Cameron University of St Andrews Combinatorics Seminar University of Vienna 23 March 2017 Selections Students often meet the following table
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationarxiv: v1 [math.co] 3 Feb 2016
On the interplay between embedded graphs and delta-matroids Carolyn Chun 1, Iain Moffatt 2, Steven D. Noble 3 and Ralf Rueckriemen 4 arxiv:1602.01306v1 [math.co] 3 Feb 2016 1 Mathematics Department, United
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationPlanar Graphs (1) Planar Graphs (3) Planar Graphs (2) Planar Graphs (4)
S-72.2420/T-79.5203 Planarity; Edges and Cycles 1 Planar Graphs (1) Topological graph theory, broadly conceived, is the study of graph layouts. Contemporary applications include circuit layouts on silicon
More informationCONSTRAINED 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 informationCross-index of a graph
Cross-index of a graph Akio Kawauchi, Ayaka Shimizu, and Yoshiro Yaguchi Abstract. A family of topological invariants of a connected graph associated to every tree is introduced and called the cross-index.
More informationTutte Functions of Matroids
Tutte Functions of Matroids Joanna Ellis-Monaghan Thomas Zaslavsky AMS Special Session on Matroids University of Kentucky 27 March 2010... and then, what? F (M) = δ e F (M\e) + γ e F (M/e) 1 2 E-M & Z
More informationBéatrice de Tilière. Université Pierre et Marie Curie, Paris. Young Women in Probability 2014, Bonn
ASPECTS OF THE DIMER MODEL, SPANNING TREES AND THE ISING MODEL Béatrice de Tilière Université Pierre et Marie Curie, Paris Young Women in Probability 2014, Bonn INTRODUCTION STATISTICAL MECHANICS Understand
More informationKNOT CLASSIFICATION AND INVARIANCE
KNOT CLASSIFICATION AND INVARIANCE ELEANOR SHOSHANY ANDERSON Abstract. A key concern of knot theory is knot equivalence; effective representation of these objects through various notation systems is another.
More informationRE-NORMALIZED LINK INVARIANTS FROM THE UNROLLED QUANTUM GROUP. 1. Introduction
RE-NORMALIZED LINK INARIANS FROM HE UNROLLED QUANUM GROUP NAHAN GEER 1 Introduction In the last several years, C Blanchet, F Costantino, B Patureau, N Reshetikhin, uraev and myself (in various collaborations)
More informationTopological Graph Polynomials and Quantum Field Theory Part I: Heat Kernel Theories
arxiv:0811.0186v1 [math-ph] 3 Nov 2008 Topological Graph Polynomials and Quantum Field Theory Part I: Heat Kernel Theories November 3, 2008 T. Krajewski 1,2, V. Rivasseau 1, A. Tanasa 3,4, Zhituo Wang
More informationModuli spaces of graphs and homology operations on loop spaces of manifolds
Moduli spaces of graphs and homology operations on loop spaces of manifolds Ralph L. Cohen Stanford University July 2, 2005 String topology:= intersection theory in loop spaces (and spaces of paths) of
More informationRECOVERING LINK DATA FROM THE B-GRAPH OF AN ALTERNATING DIAGRAM. CSUSB REU 2014 September 16,
RECOVERING LINK DATA FROM THE B-GRAPH OF AN ALTERNATING DIAGRAM MAGGIE MILLER mhmiller@math.utexas.edu CSUSB REU 2014 September 16, 2014 Abstract. In this paper we study ways in which link data may be
More informationNon-abelian statistics
Non-abelian statistics Paul Fendley Non-abelian statistics are just plain interesting. They probably occur in the ν = 5/2 FQHE, and people are constructing time-reversal-invariant models which realize
More informationA tree-decomposed transfer matrix for computing exact partition functions for arbitrary graphs
A tree-decomposed transfer matrix for computing exact partition functions for arbitrary graphs Andrea Bedini 1 Jesper L. Jacobsen 2 1 MASCOS, The University of Melbourne, Melbourne 2 LPTENS, École Normale
More informationCombinatorial Dyson-Schwinger equations and systems I Feynma. Feynman graphs, rooted trees and combinatorial Dyson-Schwinger equations
Combinatorial and systems I, rooted trees and combinatorial Potsdam November 2013 Combinatorial and systems I Feynma In QFT, one studies the behaviour of particles in a quantum fields. Several types of
More informationSkew-closed objects, typings of linear lambda terms, and flows on trivalent graphs
Skew-closed objects, typings of linear lambda terms, and flows on trivalent graphs Noam Zeilberger University of Birmingham STRING 2017, Jericho Tavern 10 September 2017 [work in progress, in part based
More informationVassiliev Invariants, Chord Diagrams, and Jacobi Diagrams
Vassiliev Invariants, Chord Diagrams, and Jacobi Diagrams By John Dougherty X Abstract: The goal of this paper is to understand the topological meaning of Jacobi diagrams in relation to knot theory and
More informationEvaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width
Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width S. D. Noble Department of Mathematical Sciences Brunel University Kingston Lane, Uxbridge UB8 3PH, U.K. steven.noble@brunel.ac.uk
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationFinding k disjoint paths in a directed planar graph
Finding k disjoint paths in a directed planar graph Alexander Schrijver CWI Kruislaan 413 1098 SJ Amsterdam The Netherlands and Department of Mathematics University of Amsterdam Plantage Muidergracht 24
More informationDecomposing plane cubic graphs
Decomposing plane cubic graphs Kenta Ozeki and Dong Ye Abstract It was conjectured by Hoffmann-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family
More informationSurface-links and marked graph diagrams
Surface-links and marked graph diagrams Sang Youl Lee Pusan National University May 20, 2016 Intelligence of Low-dimensional Topology 2016 RIMS, Kyoto University, Japan Outline Surface-links Marked graph
More informationBounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia
Bounded Treewidth Graphs A Survey German Russian Winter School St. Petersburg, Russia Andreas Krause krausea@cs.tum.edu Technical University of Munich February 12, 2003 This survey gives an introduction
More informationInfinite circuits in infinite graphs
Infinite circuits in infinite graphs Henning Bruhn Universität Hamburg R. Diestel, A. Georgakopoulos, D. Kühn, P. Sprüssel, M. Stein Henning Bruhn (U Hamburg) Infinite circuits Haifa 08 1 / 25 Locally
More informationLilypad Percolation. Enrique Treviño. April 25, 2010
Lilypad Percolation Enrique Treviño April 25, 2010 Abstract Let r be a nonnegative real number. Attach a disc of radius r to infinitely many random points (including the origin). Lilypad percolation asks
More informationThe number of Euler tours of random directed graphs
The number of Euler tours of random directed graphs Páidí Creed School of Mathematical Sciences Queen Mary, University of London United Kingdom P.Creed@qmul.ac.uk Mary Cryan School of Informatics University
More information