arXiv research

Introduce a two-variable parity polynomial for virtual knotoids

This paper is an introduction to virtual knot theory and an exposition of new ideas and constructions, including the parity bracket polynomial, the arrow polynomial, the parity arrow polynomial and categorifications of the arrow polynomial. The paper is relatively self-contained and it describes virtual knot theory bot…

We investigate an application of crossing parity for the bracket expansion of the Jones polynomial for virtual knots. In addition we consider an application of parity for the arrow polynomial as well as for the categorifications of both polynomials. We present a number of examples found through our calculations. We pro…

Polynomial-time algorithm solves random parity games with high probability.

In this paper, we define the parity virtual Alexander polynomial following the work of BDGGHN [1] and Kaestner and Kauffman [10]. The properties of this invariant are explored and some examples are computed. In particular, the invariant demonstrates that many virtual knots can not be unknotted by crossing change on onl…

We define counting and cocycle enhancement invariants of virtual knots using parity biquandles. These invariants are determined by pairs consisting of a biquandle 2-cocycle φ^0 and a map φ^1 with certain compatibility conditions leading to one-variable or two-variable polynomial invariants of virtual knots. We provide …

New examples show non-trivial parity-biquandle bracket.

We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we find all Parity Biquandles arising from the Alexander Biquandle and Quaternionic …

We prove duality theorems for twisted Reidemeister torsions and twisted Alexander polynomials generalizing the results of Turaev. As a corollary we determine the parity of the degrees of twisted Alexander polynomials of 3-manifolds in many cases.

This paper investigates the parity concept in knotoids in $S^2$ and in $\mathbb{R}^2$ in relation with virtual knots. We show that the virtual closure map is not surjective and give specific examples of virtual knots that are not in the image. We introduce a planar version of the parity bracket polynomial for knotoids …

This paper shows how the Formal Knot Theory state model for the Alexander-Conway polynomial is related to Knot Floer Homology. In particular we prove a parity result about the states in this model that clarifies certain relationships of the model with Knot Floer Homology.

In this paper we construct new invariants of knotoids including the odd writhe, the parity bracket polynomial, the affine index polynomial and the arrow polynomial, and give an introduction to the theory of virtual knotoids. The invariants in this paper are defined for classical knotoids in analogy to corresponding inv…

The paper describes new types of picture-valued invariants and their applications.

NNs can learn efficient algorithms for certain problems.

In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of the odd writhe polynomial defined by the first author. The relation between this…

In the present paper, we construct an invariant for virtual knots in the thickened sphere with g handles; this invariant is a Laurent polynomial in 2g+3 variables. To this end, we use a modification of the Wirtinger presentation of the knot group and the concept of parity introduced by V.O.Manturov. The section 4 of th…

By analyzing the affine Taylor expansion of a non-degenerate plane curve, we obtain characterizations of classes of such curves via curvature properties of the gravity curve. The proof is based on an analysis of the degree parity and leading coefficients of polynomials occurring in the expansion.

Given a finitely presented group G and an epimorphism G to the group of integers Cochran and Harvey defined a sequence of integral invariants, which can be viewed as the degrees of higher--order Alexander polynomials. Cochran and Harvey showed that (up to a minor modification) this is a never decreasing sequence of num…

We study relations between the Alexander-Conway polynomial $\nabla_L$ and Milnor higher linking numbers of links from the point of view of finite-type (Vassiliev) invariants. We give a formula for the first non-vanishing coefficient of $\nabla_L$ of an m-component link L all of whose Milnor numbers $μ_{i_1... i_p}$ van…

This paper studies rotational virtual knot theory and its relationship with quantum link invariants. Every quantum link invariant for classical knots and links extends to an invariant of rotational virtual knots and links. The paper sets up the background virtual knot theory, defines rotational virtual knot theory, stu…

Parity functors assign labels to knot diagrams based on crossing parity.

In this paper we study the chord index of virtual knots, which can be thought of as an extension of the chord parity. We show how to use the chord index to define finite type invariants of virtual knots. The notions of indexed Jones polynomial and indexed quandle are introduced, which generalize the classical Jones pol…

Parity defined for based matrices, a new example of virtual knot parity.

We introduce the 2-colour parity. It is a theory of parity for a large class of virtual links, defined using the interaction between orientations of the link components and a certain type of colouring. The 2-colour parity is an extension of the Gaussian parity, to which it reduces on virtual knots. We show that the 2-c…

In the present paper, we develop the parity theory invented in \cite{ManSb}; we construct new parities for two-component (virtual and free) links. New parities significantly depend on geometrical properties of diagrams; in particular, they are mutation-sensitive. New parities can be used practically in all problems, wh…

In \cite {FrKn,Sbornik} it was shown that in some knot theories the crucial role is played by {\em parity}, i.e.\ a function on crossings valued in $\{0,1\}$ and behaving nicely with respect to Reidemeister moves. Any parity allows one to construct functorial mappings from knots to knots, to refine many invariants and …

We identify conditional parity as a general notion of non-discrimination in machine learning. In fact, several recently proposed notions of non-discrimination, including a few counterfactual notions, are instances of conditional parity. We show that conditional parity is amenable to statistical analysis by studying ran…

Universal Gaussian parity proven for 2D knots.

New parities defined on virtual knots linked to crossing indices.

As the success of deep learning reaches more grounds, one would like to also envision the potential limits of deep learning. This paper gives a first set of results proving that certain deep learning algorithms fail at learning certain efficiently learnable functions. The results put forward a notion of cross-predictab…

This paper tackles fair Bayes-optimal classifiers under predictive parity, proving their limitations and proposing a new algorithm.

P. Berglund, T. Hübsch, and M. Henningson proposed a method to construct mirror symmetric Calabi-Yau manifolds. They considered a pair consisting of an invertible polynomial and of a finite (abelian) group of its diagonal symmetries together with a dual pair. A. Takahashi suggested a method to generalize this construct…

Parity calibration aims to predict increase-decrease events, not values.

Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.

Functorial maps and weak parities are equivalent descriptions of rules of substitution virtual crossings for classical in diagrams of a knot in a way compatible with Reidemeister moves. We introduce the notion of maximal weak parity and describe it for knots in a given closed oriented surface. This weak parity defines …

We introduce Tristram-Levine signatures of virtual knots and use them to investigate virtual knot concordance. The signatures are defined first for almost classical knots, which are virtual knots admitting homologically trivial representations. The signatures and $ω$-signatures are shown to give bounds on the topologic…

Paper solves k-sparse parity problem with sign SGD, matching SQ lower bound.

Neural networks struggle with learning fixed parities.

Study shows physical drift affects put-call parity enforcement, not just option payoffs.

Parity mappings from the chords of a Gauss diagram to the integers is defined. The parity of the chords is used to construct families of invariants of Gauss diagrams and virtual knots. One family consists of degree $n$ Vassiliev invariants.

Counterfactual fairness not equivalent to demographic parity, finds study.

Transformers solve parity problems efficiently with step-by-step reasoning.

2-dimensional knots and links are studied in the article. The notion of parity is introduced via techniques similar to the ones used by the second named author in 1-dimensional case. By using parity new invariants are constructed and known invariants are refined.

Fairness constraints improve exact recovery in structured prediction models.

High-performance quantum codes decoded with minimal data.

New causal analysis reconciles predictive and statistical fairness.

Proposes a framework to create fair IDRs by enforcing demographic parity constraints.

New method controls bias in training data for fair outcomes.