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.

Identifying non-pseudo-alternating knots by using the free factor property of minimal genus Seifert surfaces

Pseudo-alternating knots and links are defined constructively via their Seifert surfaces. By performing Murasugi sums of primitive flat surfaces, such a knot or link is obtained as the boundary of the resulting surface. Conversely, it is hard to determine whether a given knot or link is pseudo-alternating or not. A major difficulty is the lack of criteria to recognize whether a given Seifert surface is decomposable as a Murasugi sum. In this paper, we propose a new idea to identify non-pseudo-alternating knots. Combining with the uniqueness of minimal genus Seifert surface obtained through sutured manifold theory, we demonstrate that two infinite classes of pretzel knots are not pseudo-alternating.

Piecewise-linear embeddings of knots and links with rotoinversion symmetry

This article describes the simplest members of an infinite family of knots and links that have achiral piecewise-linear embeddings in which linear segments (sticks) meet at corners. The structures described are all corner- and stick-2-transitive – the smallest possible for achiral knots.

Vassiliev invariants for flows via Chern–Simons perturbation theory

The perturbative expansion of Chern–Simons gauge theory leads to invariants of knots and links, the so-called finite type invariants or Vassiliev invariants. It has been proved that at any order in perturbation theory the superposition of certain amplitudes is an invariant of that order. Bott–Taubes integrals on configuration spaces are introduced in the present context to write Feynman diagrams at a given order in perturbation theory in a geometrical and topological framework. One of the consequences of this formalism is that the resulting amplitudes are rewritten in cohomological terms in configuration spaces. This cohomological structure can be used to translate Bott–Taubes integrals into Chern–Simons perturbative amplitudes and vice versa. In this paper, this program is performed up to third order in the coupling constant. This expands some work previously worked out by Thurston. Finally we take advantage of these results to incorporate in the formalism a smooth and divergenceless vector field on the 3-manifold. The Bott–Taubes integrals obtained are used for constructing higher-order average asymptotic Vassiliev invariants extending the work of Komendarczyk and Volić.

Stick numbers of Montesinos knots

Negami found an upper bound on the stick number [Formula: see text] of a nontrivial knot [Formula: see text] in terms of the minimal crossing number [Formula: see text]: [Formula: see text]. Huh and Oh found an improved upper bound: [Formula: see text]. Huh, No and Oh proved that [Formula: see text] for a [Formula: see text]-bridge knot or link [Formula: see text] with at least six crossings. As a sequel to this study, we present an upper bound on the stick number of Montesinos knots and links. Let [Formula: see text] be a knot or link which admits a reduced Montesinos diagram with [Formula: see text] crossings. If each rational tangle in the diagram has five or more index of the related Conway notation, then [Formula: see text]. Furthermore, if [Formula: see text] is alternating, then we can additionally reduce the upper bound by [Formula: see text].