Recurrent Generalization of F-Polynomials for Virtual Knots and Links

F-polynomials for virtual knots were defined by Kaur, Prabhakar and Vesnin in 2018 using flat virtual knot invariants. These polynomials naturally generalize Kauffman’s affine index polynomial and use smoothing in the classical crossing of a virtual knot diagram. In this paper, we introduce weight functions for ordered orientable virtual and flat virtual links. A flat virtual link is an equivalence class of virtual links with respect to a local symmetry changing a type of classical crossing in a diagram. By considering three types of smoothing in classical crossings of a virtual link diagram and suitable weight functions, there is provided a recurrent construction for new invariants. It is demonstrated by explicit examples that newly defined polynomial invariants are stronger than F-polynomials.

On the potential functions for a link diagram

Cho and Murakami defined the potential function for a link [Formula: see text] in [Formula: see text] whose critical point, slightly different from the usual sense, corresponds to a boundary-parabolic representation [Formula: see text]. They also showed that the volume and Chern–Simons invariant of [Formula: see text] can be computed from the potential function with its partial derivatives. In this paper, we extend the potential function to a representation that is not necessarily boundary-parabolic. We show that under a mild assumption it leads us to a combinatorial formula for computing the volume and Chern–Simons invariant of a [Formula: see text]-representation of a closed 3-manifold.

Exploring the application of property graph model in visualizing COBie data

Purpose The usability aspect of the construction operations building information exchange (COBie) datasheet has been largely overlooked. Users find it difficult to find relevant data inside COBie and understand the dependencies of information. This research study is a part of a more comprehensive research study to identify the usability issues associated with COBie and propose solutions to deal with them. This paper aims to discuss the challenges associated with the visualization aspect of COBie and proposes a solution to mitigate them. Design/methodology/approach This paper is based on design thinking and waterfall methodology. While the design thinking methodology is used to explore the issues associated with the visualization aspect of COBie, the waterfall methodology is used to develop a working prototype of the visualizer for the COBie datasheet using a spreadsheet format. Findings The paper demonstrates that the property graph model based on a node-link diagram can be effectively used to represent the COBie datasheet. This will help in storing data in a visually connected manner and looking at links more dynamically. Moreover, converting and storing data into an appropriate database will help reach data directly rather than navigate multiple workbooks. This database can also help get the history of data inside the COBie datasheet as it develops throughout the project. Originality/value This research proposes a novel approach to visualize the COBie datasheet interactively using the property graph model, a type of node-link diagram. Using the property graph model will help users see data in a connected way, which is currently missing in the spreadsheet representation of COBie data. Moreover, this research also highlights that storing historical changes in COBie data can help understand how data has evolved throughout the construction. Additionally, structured storage of data in relationship format can help users to access the end of connected data directly through the efficient search.

Span of the Jones polynomials of certain v-adequate virtual links

It is known that the Kauffman–Murasugi–Thislethwaite type inequality becomes an equality for any (possibly virtual) adequate link diagram. We refine this condition. As an application we obtain a criterion for virtual link diagram with exactly one virtual crossing to represent a properly virtual link.

Writhe-like invariants of alternating links

It is known that the writhe calculated from any reduced alternating link diagram of the same (alternating) link has the same value. That is, it is a link invariant if we restrict ourselves to reduced alternating link diagrams. This is due to the fact that reduced alternating link diagrams of the same link are obtainable from each other via flypes and flypes do not change writhe. In this paper, we introduce several quantities that are derived from Seifert graphs of reduced alternating link diagrams. We prove that they are “writhe-like” invariants, namely they are not general link invariants, but are invariants when restricted to reduced alternating link diagrams. The determination of these invariants are elementary and non-recursive so they are easy to calculate. We demonstrate that many different alternating links can be easily distinguished by these new invariants, even for large, complicated knots for which other invariants such as the Jones polynomial are hard to compute. As an application, we also derive an if and only if condition for a strongly invertible rational link.

A description of Rasmussen’s invariant from the divisibility of Lee’s canonical class

We give a description of Rasmussen’s [Formula: see text]-invariant from the divisibility of Lee’s canonical class. More precisely, given any link diagram [Formula: see text], for any choice of an integral domain [Formula: see text] and a non-zero, non-invertible element [Formula: see text], we define the [Formula: see text]-divisibility [Formula: see text] of Lee’s canonical class of [Formula: see text], and prove that a combination of [Formula: see text] and some elementary properties of [Formula: see text] yields a link invariant [Formula: see text]. Each [Formula: see text] possesses properties similar to [Formula: see text], which in particular reproves the Milnor conjecture. If we restrict to knots and take [Formula: see text], then our invariant coincides with [Formula: see text].

Tribracket Modules

Niebrzydowski tribrackets are ternary operations on sets satisfying conditions obtained from the oriented Reidemeister moves such that the set of tribracket colorings of an oriented knot or link diagram is an invariant of oriented knots and links. We introduce tribracket modules analogous to quandle/biquandle/rack modules and use these structures to enhance the tribracket counting invariant. We provide examples to illustrate the computation of the invariant and show that the enhancement is proper.

Ineffective sets and the region crossing change operation

Region crossing change (RCC) is an operation on link diagrams in which all crossings incident to a selected region are changed. Two diagrams are called RCC-equivalent if one can be transformed to the other via a sequence of RCCs. RCC is an unknotting operation but not an unlinking operation. A set of regions of a diagram is called ineffective if RCCs at every region in that set have no net effect on the crossings of the diagram. The main result of this paper is a construction of the complete collection of ineffective sets for any link diagram. This involves a combination of linear algebraic and diagrammatic techniques including a generalization of checkerboard shading called tricoloring. Using this construction of ineffective sets, we provide sharp upper bounds on the maximum number of RCCs needed to transform between RCC-equivalent knot diagrams and reduced 2- and 3-component link diagrams with fixed underlying projections.

The Cone Structure Theorem

We consider the topological classification of finitely determined map germs $f:(\mathbb{R}^n,0)\to (\mathbb{R}^p,0)$ with $f^{-1}(0)\neq \{0\}$. Associated with $f$ we have a link diagram, which is well defined up to topological equivalence. We prove that $f$ is topologically $\mathcal{A}$-equivalent to the generalized cone of its link diagram.

Wirtinger numbers for virtual links

The Wirtinger number of a virtual link is the minimum number of generators of the link group over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger number of a virtual link equals its virtual bridge number. Since the Wirtinger number is algorithmically computable, it gives a more effective way to calculate an upper bound for the virtual bridge number from a virtual link diagram. As an application, we compute upper bounds for the virtual bridge numbers and the quandle counting invariants of virtual knots with 6 or fewer crossings. In particular, we found new examples of nontrivial virtual bridge number one knots, and by applying Satoh’s Tube map to these knots we can obtain nontrivial weakly superslice links.