Displaying similar documents to “Spatial graphs, knots and the cyclic polytope.”

Cyclic branched coverings of 2-bridge knots.

Alberto Cavicchioli, Beatrice Ruini, Fulvia Spaggiari (1999)

Revista Matemática Complutense

Similarity:

In this paper we study the connections between cyclic presentations of groups and the fundamental group of cyclic branched coverings of 2-bridge knots. Then we show that the topology of these manifolds (and knots) arises, in a natural way, from the algebraic properties of such presentations.

Topological Complexity in Protein Structures

Erica Flapan, Gabriella Heller (2015)

Molecular Based Mathematical Biology

Similarity:

For DNA molecules, topological complexity occurs exclusively as the result of knotting or linking of the polynucleotide backbone. By contrast, while a few knots and links have been found within the polypeptide backbones of some protein structures, non-planarity can also result from the connectivity between a polypeptide chain and inter- and intra-chain linking via cofactors and disulfide bonds. In this article, we survey the known types of knots, links, and non-planar graphs in protein...

Nonfibered knots and representation shifts

Daniel S. Silver, Susan G. Williams (2009)

Banach Center Publications

Similarity:

A conjecture of [swTAMS] states that a knot is nonfibered if and only if its infinite cyclic cover has uncountably many finite covers. We prove the conjecture for a class of knots that includes all knots of genus 1, using techniques from symbolic dynamics.

An operator invariant for handlebody-knots

Kai Ishihara, Atsushi Ishii (2012)

Fundamenta Mathematicae

Similarity:

A handlebody-knot is a handlebody embedded in the 3-sphere. We improve Luo's result about markings on a surface, and show that an IH-move is sufficient to investigate handlebody-knots with spatial trivalent graphs without cut-edges. We also give fundamental moves with a height function for handlebody-tangles, which helps us to define operator invariants for handlebody-knots. By using the fundamental moves, we give an operator invariant.

On cyclically embeddable graphs

Mariusz Woźniak (1999)

Discussiones Mathematicae Graph Theory

Similarity:

An embedding of a simple graph G into its complement G̅ is a permutation σ on V(G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.