Related papers: Trace Diagrams and Biquandle Brackets
Recently, Ozsv\'ath and Szab\'o introduced some algebraic constructions computing knot Floer homology in the spirit of bordered Floer homology, including a family of algebras B(n) and, for a generator of the braid group on n strands, a…
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and…
New explicit procedures for passing among triplane diagrams, braid movies, and braid charts for knotted surfaces in $\mathbb{R}^4$ are presented. To this end, rainbow diagrams, which lie between braid charts and triplanes, are introduced.…
We present a topological interpretation of knot and braid contact homology in degree zero, in terms of cords and skein relations. This interpretation allows us to extend the knot invariant to embedded graphs and higher-dimensional knots. We…
We introduce a simple combinatorial method for computing all versions of the knot Floer homology of the preimage of a two-bridge knot K(p,q) inside its double-branched cover, -L(p,q). The 4-pointed genus 1 Heegaard diagram we obtain looks…
Given a knot diagram $D$, we construct a semi-threading circle for it which can be an axis of $D$ as a closed braid depending on knot diagrams. In particular, we consider semi-threading circles for minimal diagrams of a knot with respect to…
We define a traced pseudomonoid as a pseudomonoid in a monoidal bicategory equipped with extra structure, giving a new characterisation of Cauchy complete traced monoidal categories as algebraic structures in $\mathbf{Prof}$, the monoidal…
We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
The paper is a continuation of the study started in \cite{Yorzh1}. Schrodinger operators on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of $\delta$ type. Either an…
In this paper we study some aspects of knots and links in lens spaces. Namely, if we consider lens spaces as quotient of the unit ball $B^{3}$ with suitable identification of boundary points, then we can project the links on the equatorial…
For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…
We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…
A variant of the trace in a monoidal category is given in the setting of closed monoidal derivators, which is applicable to endomorphisms of fiberwise dualizable objects. Functoriality of this trace is established. As an application, an…
We generalize the notion of biquandles to psyquandles and use these to define invariants of oriented singular links and pseudolinks. In addition to psyquandle counting invariants, we introduce Alexander psyquandles and corresponding…
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…
Classical knots in $\mathbb{R}^3$ can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes…