Related papers: Picture-valued parity-biquandle bracket II. Exampl…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
We produce a facial state sum on plane diagrams of a knot or a link which admits an invariant specialization under Polyak's recent set of generating of 4 Reidemeister moves. Thus an isotopy invariant of framed links is obtained. Each state…
We construct a new invariant of singular links through representations of the singular braid monoid into the two parameters bt-algebra. Additionally, we recover this invariant by using the approach of Paris and Rabenda. Hence, we introduce…
Let $G$ be a signed graph. Let $\hat{G}$ be the graph obtained from $G$ by replacing each edge $e$ by a chain or a sheaf. We first establish a relation between the $Q$-polynomial of $\hat{G}$[6] and the $W$-polynomial of $G$ [9]. Two…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
In 1981, Duffus, Gould, and Jacobson showed that every connected graph either has a Hamiltonian path, or contains a claw ($K_{1,3}$) or a net (a fixed six-vertex graph) as an induced subgraph. This implies that subject to being connected,…
The goal of this paper is to give a diagrammatical characterization of the information given by the Milnor invariants of links and string links. More precisely, we describe when two string links have equal Milnor invariants of length $\leq…
Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…
Starting with the Brezis-Browder principle, we give stronger versions of many variational principles and minimal element theorems which appeared in the recent literature. Relationships among the elements of different sets of assumptions are…
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…
We introduce new topological quantum invariants of compact oriented 3-manifolds with boundary where the boundary is a disjoint union of two identical surfaces. The invariants are constructed via surgery on manifolds of the form $F \times I$…
We extend the Gordon-Litherland pairing to links in thickened surfaces, and use it to define signature, determinant, and nullity invariants for links that bound (unoriented) spanning surfaces. The invariants are seen to depend only on the…
A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…
We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet…
For Hamiltonian circle actions on compact, connected, four-dimensional manifolds, we give a generators and relations description for the even part of the equivariant cohomology, as an algebra over the equivariant cohomology of a point. This…
In this paper we present a sequence of link invariants, defined from twisted Alexander polynomials, and discuss their effectiveness in distinguish knots. In particular, we recast and extend by geometric means a recent result of Silver and…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
For a simple graph, the minimum rank problem is to determine the smallest rank among the symmetric matrices whose off-diagonal nonzero entries occur in positions corresponding to the edges of the graph. Bounds on this minimum rank (and on…
We introduce new skein invariants of links based on a procedure where we first apply the skein relation only to crossings of distinct components, so as to produce collections of unlinked knots. We then evaluate the resulting knots using a…