Mathematics – Geometric Topology
Scientific paper
2010-03-08
Mathematics
Geometric Topology
v2: 32 pages, 12 figures. v3: 36 pages, 16 figures. A significant error involving the writhe is corrected in v3. Further chang
Scientific paper
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated to a directed Euler system of the universe graph of D. Here we extend the graph bracket to graphs whose vertices may carry different kinds of marks, and we show how multiply marked graphs encode interlacement with respect to arbitrary (undirected) Euler systems. The extended machinery brings together the earlier version and the graph-links of D. P. Ilyutko and V. O. Manturov [J. Knot Theory Ramifications 18 (2009), 791-823]. The greater flexibility of the extended bracket also allows for a recursive description much simpler than that of the earlier version.
No associations
LandOfFree
A bracket polynomial for graphs, IV. Undirected Euler circuits, graph-links and multiply marked graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A bracket polynomial for graphs, IV. Undirected Euler circuits, graph-links and multiply marked graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A bracket polynomial for graphs, IV. Undirected Euler circuits, graph-links and multiply marked graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-676668