317 research outputs found
Unsigned state models for the Jones polynomial
It is well a known and fundamental result that the Jones polynomial can be
expressed as Potts and vertex partition functions of signed plane graphs. Here
we consider constructions of the Jones polynomial as state models of unsigned
graphs and show that the Jones polynomial of any link can be expressed as a
vertex model of an unsigned embedded graph.
In the process of deriving this result, we show that for every diagram of a
link in the 3-sphere there exists a diagram of an alternating link in a
thickened surface (and an alternating virtual link) with the same Kauffman
bracket. We also recover two recent results in the literature relating the
Jones and Bollobas-Riordan polynomials and show they arise from two different
interpretations of the same embedded graph.Comment: Minor corrections. To appear in Annals of Combinatoric
Line-graphs of cubic graphs are normal
A graph is called normal if its vertex set can be covered by cliques and also
by stable sets, such that every such clique and stable set have non-empty
intersection. This notion is due to Korner, who introduced the class of normal
graphs as an extension of the class of perfect graphs. Normality has also
relevance in information theory. Here we prove, that the line graphs of cubic
graphs are normal.Comment: 16 pages, 10 figure
Parallel Mapper
The construction of Mapper has emerged in the last decade as a powerful and
effective topological data analysis tool that approximates and generalizes
other topological summaries, such as the Reeb graph, the contour tree, split,
and joint trees. In this paper, we study the parallel analysis of the
construction of Mapper. We give a provably correct parallel algorithm to
execute Mapper on multiple processors and discuss the performance results that
compare our approach to a reference sequential Mapper implementation. We report
the performance experiments that demonstrate the efficiency of our method
Spin Foams and Noncommutative Geometry
We extend the formalism of embedded spin networks and spin foams to include
topological data that encode the underlying three-manifold or four-manifold as
a branched cover. These data are expressed as monodromies, in a way similar to
the encoding of the gravitational field via holonomies. We then describe
convolution algebras of spin networks and spin foams, based on the different
ways in which the same topology can be realized as a branched covering via
covering moves, and on possible composition operations on spin foams. We
illustrate the case of the groupoid algebra of the equivalence relation
determined by covering moves and a 2-semigroupoid algebra arising from a
2-category of spin foams with composition operations corresponding to a fibered
product of the branched coverings and the gluing of cobordisms. The spin foam
amplitudes then give rise to dynamical flows on these algebras, and the
existence of low temperature equilibrium states of Gibbs form is related to
questions on the existence of topological invariants of embedded graphs and
embedded two-complexes with given properties. We end by sketching a possible
approach to combining the spin network and spin foam formalism with matter
within the framework of spectral triples in noncommutative geometry.Comment: 48 pages LaTeX, 30 PDF figure
Connectedness of graphs and its application to connected matroids through covering-based rough sets
Graph theoretical ideas are highly utilized by computer science fields
especially data mining. In this field, a data structure can be designed in the
form of tree. Covering is a widely used form of data representation in data
mining and covering-based rough sets provide a systematic approach to this type
of representation. In this paper, we study the connectedness of graphs through
covering-based rough sets and apply it to connected matroids. First, we present
an approach to inducing a covering by a graph, and then study the connectedness
of the graph from the viewpoint of the covering approximation operators.
Second, we construct a graph from a matroid, and find the matroid and the graph
have the same connectedness, which makes us to use covering-based rough sets to
study connected matroids. In summary, this paper provides a new approach to
studying graph theory and matroid theory
Nucleation-free rigidity
When all non-edge distances of a graph realized in as a {\em
bar-and-joint framework} are generically {\em implied} by the bar (edge)
lengths, the graph is said to be {\em rigid} in . For ,
characterizing rigid graphs, determining implied non-edges and {\em dependent}
edge sets remains an elusive, long-standing open problem.
One obstacle is to determine when implied non-edges can exist without
non-trivial rigid induced subgraphs, i.e., {\em nucleations}, and how to deal
with them.
In this paper, we give general inductive construction schemes and proof
techniques to generate {\em nucleation-free graphs} (i.e., graphs without any
nucleation) with implied non-edges. As a consequence, we obtain (a) dependent
graphs in that have no nucleation; and (b) nucleation-free {\em
rigidity circuits}, i.e., minimally dependent edge sets in . It
additionally follows that true rigidity is strictly stronger than a tractable
approximation to rigidity given by Sitharam and Zhou
\cite{sitharam:zhou:tractableADG:2004}, based on an inductive combinatorial
characterization.
As an independently interesting byproduct, we obtain a new inductive
construction for independent graphs in . Currently, very few such inductive
constructions are known, in contrast to
- …