Related papers: Braided chord diagrams

In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…

We consider the notion of mosaic diagrams for surface-links using marked graph diagrams. We establish bounds, in some cases tight, on the mosaic numbers for the surface-links with ch-index up to 10. As an application, we use mosaic diagrams…

A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more…

A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of a graph, was recently developed as a tool for lower…

Biquandle brackets are a type of quantum enhancement of the biquandle counting invariant for oriented knots and links, defined by a set of skein relations with coefficients which are functions of biquandle colors at a crossing. In this…

Torus knots are an important family of knots about which much is understood; invariants of torus knots often exhibit nice formulas, making them convenient and fundamental building blocks for examples in knot theory. Spiral knots, defined…

The main result of this paper is a negative answer to the question: are all transversal knot types transversally simple? An explicit infinite family of examples is given of closed 3-braids that define transversal knot types that are not…

This paper is concerned with detecting when a closed braid and its axis are 'mutually braided' in the sense of Rudolph. It deals with closed braids which are fibred links, the simplest case being closed braids which present the unknot. The…

In this note, we construct a chord index homomorphism from a subgroup of $H_1(\Sigma, \mathbb{Z})$ to the group of chord indices of a knot $K$ in $\Sigma\times I$. Some knot invariants derived from this homomorphism are discussed.

We define two new families of invariants for (3-manifold, graph) pairs which detect the unknot and are additive under connected sum of pairs and (-1/2)-additive under trivalent vertex sum of pairs. The first of these families is closely…

Laundry surfaces for closed braid diagrams are presented. It is shown that braid diagrams are characterized by linking matrices obtained by lifting cycles from these surfaces. Oriented link types are then characterized by equivalence…

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

We prove that if an alternating 3-braid knot has unknotting number one, then there must exist an unknotting crossing in any alternating diagram of it, and we enumerate such knots. The argument combines the obstruction to unknotting number…

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Bonded knots arise naturally in topological protein modeling, where intramolecular interactions such as disulfide bridges stabilize folded configurations. These structures extend classical knot theory by incorporating embedded graphs, and…

Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…

We show that 3-braid links with given (non-zero) Alexander or Jones polynomial are finitely many, and can be effectively determined. We classify among closed 3-braids strongly quasipositive and fibered ones, and show that 3-braid links have…