Related papers: Trace Diagrams and Biquandle Brackets
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…
We introduce a new algebraic structure called \textit{local biquandles} and show how colorings of oriented classical link diagrams and of broken surface diagrams are related to tribracket colorings. We define a (co)homology theory for local…
Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in $\mathbb{R}^4$; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are…
In their paper entitled "Quantum Enhancements and Biquandle Brackets," Nelson, Orrison, and Rivera introduced biquandle brackets, which are customized skein invariants for biquandle-colored links. These invariants generalize the Jones…
We use grid diagrams to present a unified picture of braids, Legendrian knots, and transverse knots.
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface (called a surface-link) embedded in 4-space. In this paper,…
In [14], the second named author constructed the bracket invariant [.] of virtual knots valued in pictures (linear combinations of virtual knot diagrams with some crossing information omitted), such that for many diagrams K, the following…
In this paper, we introduce biquandle power brackets, an infinite family of invariants of oriented links containing the classical skein invariants and the quandle and biquandle 2-cocycle invariants as special cases. Biquandle power brackets…
We introduce several algebraic structures related to handlebody-knots, including $G$-families of biquandles, partially multiplicative biquandles and group decomposable biquandles. These structures can be used to color the semiarcs in…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
We introduce virtual tribrackets, an algebraic structure for coloring regions in the planar complement of an oriented virtual knot or link diagram. We use these structures to define counting invariants of virtual knots and links and provide…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…
We study alternating strand diagrams on the disk with an orbifold point. These are quotients by rotation of Postnikov diagrams on the disk, and we call them orbifold diagrams. We associate a quiver with potential to each orbifold diagram,…
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…
We define invariants of oriented surface-links by enhancing the biquandle counting invariant using \textit{biquandle modules}, algebraic structures defined in terms of biquandle actions on commutative rings analogous to Alexander…
We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…