Iain Moffatt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Iain Moffatt has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Joanna A. Ellis Monaghan
Korteweg-de Vries Institute for Mathematics University of Amsterdam Science Park 105-107 1098 XH Amsterdam the Netherlands
3 shared publications - Stephen Huggett
School of Computing and Mathematics University of Plymouth PL4 8AA Devon UK.
3 shared publications - Leslie M. McDonald
University of South Alabama
2 shared publications Joanna A. Ellis-Monaghan
Saint Michael's College, Colchester, USA
1 shared publication- Martin Loebl
Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Malostranské nám. 25 11800 Prague CZE
1 shared publication - Natalia Virdee
School of Computing and Mathematics, University of Plymouth, PL4 8AA, Devon
1 shared publication
Latest Publications
- 31 December 2014
- Published by European Mathematical Society - EMS - Publishing House GmbH in Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions
- Vol. 1 (4) , 429-442
A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model
- 31 December 2014
- Published by European Mathematical Society - EMS - Publishing House GmbH in Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions
- Vol. 1 (4) , 429-442
A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model
- 20 March 2012
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 153 (1) , 123-145
On the Seifert graphs of a link diagram and its parallels
Recently, Dasbach, Futer, Kalfagianni, Lin and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or, equivalently, cellularly embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a characterization of Seifert graphs in terms of Eulerian subgraphs. This characterization can be viewed as a refinement of the fact that Seifert graphs are bipartite. We go on to examine the family of ribbon graphs that arises by forming the parallels of a link diagram and determine how the genus of the ribbon graph of ar-fold parallel of a link diagram is related to that of the original link diagram.
- 20 March 2012
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 153 (1) , 123-145
On the Seifert graphs of a link diagram and its parallels
Recently, Dasbach, Futer, Kalfagianni, Lin and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or, equivalently, cellularly embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon graphs of a knot or link diagram that arise from Seifert states. We provide a characterization of Seifert graphs in terms of Eulerian subgraphs. This characterization can be viewed as a refinement of the fact that Seifert graphs are bipartite. We go on to examine the family of ribbon graphs that arises by forming the parallels of a link diagram and determine how the genus of the ribbon graph of ar-fold parallel of a link diagram is related to that of the original link diagram.
- Open Access
- 1 March 2012
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 364 (3) , 1529-1569
Twisted duality for embedded graphs
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge, and taking the partial dual with respect to the edge. These two operations give rise to an action of <!-- MATH ${S_3}^{|E(G)|}$ --> , the ribbon group, on . The action of the ribbon group on embedded graphs extends the concepts of duality, partial duality, and Petrie duality. We show that this ribbon group action gives a complete characterization of duality in that if is any cellularly embedded graph with medial graph , then the orbit of under the group action is precisely the set of all graphs with medial graphs isomorphic (as abstract graphs) to . We provide characterizations of special sets of twisted duals (such as the partial duals) of embedded graphs in terms of medial graphs, and we show how different kinds of graph isomorphism give rise to these various notions of duality. The ribbon group action then leads to a deeper understanding of the properties of, and relationships among, various graph polynomials via the generalized transition polynomial which interacts naturally with the ribbon group action.- 1 March 2012
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 364 (3) , 1529-1569
Open AccessTwisted duality for embedded graphs
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge, and taking the partial dual with respect to the edge. These two operations give rise to an action of <!-- MATH ${S_3}^{|E(G)|}$ --> , the ribbon group, on . The action of the ribbon group on embedded graphs extends the concepts of duality, partial duality, and Petrie duality. We show that this ribbon group action gives a complete characterization of duality in that if is any cellularly embedded graph with medial graph , then the orbit of under the group action is precisely the set of all graphs with medial graphs isomorphic (as abstract graphs) to . We provide characterizations of special sets of twisted duals (such as the partial duals) of embedded graphs in terms of medial graphs, and we show how different kinds of graph isomorphism give rise to these various notions of duality. The ribbon group action then leads to a deeper understanding of the properties of, and relationships among, various graph polynomials via the generalized transition polynomial which interacts naturally with the ribbon group action. - 25 February 2012
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 146 (6) , 1288-1302
On the Potts Model Partition Function in an External Field
- 25 February 2012
- Published by Springer Nature in Journal of Statistical Physics
- Vol. 146 (6) , 1288-1302
On the Potts Model Partition Function in an External Field
- Open Access
Bipartite partial duals and circuits in medial graphs
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented circuits in its medial graph.
Open AccessBipartite partial duals and circuits in medial graphs
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented circuits in its medial graph.
- Open Access
On the Potts model partition function in an external field
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we show that it can be expanded in terms of the zero-field partition function. We also show that Z can be written as a sum over the spanning trees, and the spanning forests, of a graph G. Our results extend to Z the well-known spanning tree expansion for the zero-field partition function that arises though its connections with the Tutte polynomial.
Open AccessOn the Potts model partition function in an external field
We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we show that it can be expanded in terms of the zero-field partition function. We also show that Z can be written as a sum over the spanning trees, and the spanning forests, of a graph G. Our results extend to Z the well-known spanning tree expansion for the zero-field partition function that arises though its connections with the Tutte polynomial.
- 7 October 2011
- Published by Springer Nature in Annals of Combinatorics
- Vol. 15 (4) , 675-706
Expansions for the Bollobás-Riordan Polynomial of Separable Ribbon Graphs
- 7 October 2011
- Published by Springer Nature in Annals of Combinatorics
- Vol. 15 (4) , 675-706
Expansions for the Bollobás-Riordan Polynomial of Separable Ribbon Graphs
- 20 March 2011
- Published by Springer Nature in Annals of Combinatorics
- Vol. 15 (1) , 127-146
Unsigned State Models for the Jones Polynomial
- 20 March 2011
- Published by Springer Nature in Annals of Combinatorics
- Vol. 15 (1) , 127-146
Unsigned State Models for the Jones Polynomial
- Open Access
The Tutte-Potts connection in the presence of an external magnetic field
The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic fields that appear in most Potts model applications. Here we define the V-polynomial, which lifts the classical relationship between the Tutte polynomial and the zero field Potts model to encompass external magnetic fields. The V-polynomial generalizes Nobel and Welsh's W-polynomial, which extends the Tutte polynomial by incorporating vertex weights and adapting contraction to accommodate them. We prove that the variable field Potts model partition function (with its many specializations) is an evaluation of the V-polynomial, and hence a polynomial with deletion-contraction reduction and Fortuin-Kasteleyn type representation. This unifies an important segment of Potts model theory and brings previously successful combinatorial machinery, including complexity results, to bear on a wider range of statistical mechanics models.
Open AccessThe Tutte-Potts connection in the presence of an external magnetic field
The classical relationship between the Tutte polynomial of graph theory and the Potts model of statistical mechanics has resulted in valuable interactions between the disciplines. Unfortunately, it does not include the external magnetic fields that appear in most Potts model applications. Here we define the V-polynomial, which lifts the classical relationship between the Tutte polynomial and the zero field Potts model to encompass external magnetic fields. The V-polynomial generalizes Nobel and Welsh's W-polynomial, which extends the Tutte polynomial by incorporating vertex weights and adapting contraction to accommodate them. We prove that the variable field Potts model partition function (with its many specializations) is an evaluation of the V-polynomial, and hence a polynomial with deletion-contraction reduction and Fortuin-Kasteleyn type representation. This unifies an important segment of Potts model theory and brings previously successful combinatorial machinery, including complexity results, to bear on a wider range of statistical mechanics models.
- Open Access
A permanent formula for the Jones polynomial
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a planar diagram of a link L with $n$ crossings, we define a 7n by 7n matrix whose permanent equals to the Jones polynomial of L. This result accompanied with recent work of Freedman, Kitaev, Larson and Wang provides a Monte-Carlo algorithm to any decision problem belonging to the class BQP, i.e. such that it can be computed with bounded error in polynomial time using quantum resources.Open AccessA permanent formula for the Jones polynomial
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a planar diagram of a link L with $n$ crossings, we define a 7n by 7n matrix whose permanent equals to the Jones polynomial of L. This result accompanied with recent work of Freedman, Kitaev, Larson and Wang provides a Monte-Carlo algorithm to any decision problem belonging to the class BQP, i.e. such that it can be computed with bounded error in polynomial time using quantum resources.