Related papers: Parity on based matrices
We catalog some simple conditions which are sufficient to guarantee that R-parity survives as an unbroken gauged discrete subgroup of the continuous gauge symmetry in certain supersymmetric extensions of the standard model.
Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest…
We define an invariant of tangles and framed tangles given a finite crossed module and a pair of functions, called a Reidemeister pair, satisfying natural properties. We give several examples of Reidemeister pairs derived from racks,…
Everett et al. introduced several varieties of stabbing information for the lines determined by pairs of vertices of a simple polygon P, and established their relationships to vertex visibility and other combinatorial data. In the same…
Virtual knot theory is a generalization (discovered by the author in 1996) of knot theory to the study of all oriented Gauss codes. (Classical knot theory is a study of planar Gauss codes.) Graph theory studies non-planar graphs via…
Knotoids are open ended knot diagrams regarded up to Reidemeister moves and isotopies. The notion is introduced by V.~Turaev in 2012. Two most important numeric characteristics of a knotoid are the crossing number and the height. The latter…
Given a stratified variety X with strata satisfying a cohomological parity-vanishing condition, we define and show the uniqueness of "parity sheaves", which are objects in the constructible derived category of sheaves with coefficients in…
Braiding operators corresponding to the third Reidemeister move in the theory of knots and links are realized in terms of parametrized unitary matrices for all dimensions. Two distinct classes are considered. Their (non-local) unitary…
Some natural inequalities related to rearrangement in matrix products can also be regarded as extensions of classical inequalities for sequences or integrals. In particular, we show matrix versions of Chebyshev and Kantorovich type…
This is a survey of some recent progress on quantum symmetric pairs and applications. The topics include quasi K-matrices, $\imath$Schur duality, canonical bases, super Kazhdan-Lusztig theory, $\imath$Hall algebras, current presentations…
In this paper, we present a brief overview of the concept of doodles from the perspective of J.S. Carter's work on classifying immersed curves and the work of J.S. Carter, S. Kamada, and M. Saito on stable equivalence of knots on surfaces…
This is essentially an expository note based on S. Paul's works on the stability of pairs. Its connection to K-stability will be also discussed.
Two virtual link diagrams are homotopic if one may be transformed into the other by a sequence of virtual Reidemeister moves, classical Reidemeister moves, and self crossing changes. We recall the pure virtual braid group. We then describe…
We propose a test of fairness in score-based ranking systems called matched pair calibration. Our approach constructs a set of matched item pairs with minimal confounding differences between subgroups before computing an appropriate measure…
Let $D$ be an oriented link diagram with the set of regions $\operatorname{r}_{D}$. We define a symmetric map (or matrix) $\operatorname{\tau}_{D}\colon\operatorname{r}_{D}\times \operatorname{r}_{D} \to \mathbb{Z}[x]$ that gives rise to an…
The main result of this paper is the construction of a trace and a trace pairing for endomorphisms satisfying suitable conditions in a monoidal category. This construction is a common generalization of the trace for endomorphisms of…
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…
The Turaev genus of a knot is a topological measure of how far a given knot is from being alternating. Recent work by several authors has focused attention on this interesting invariant. We discuss how the Turaev genus is related to other…
In this paper we develop a general theoretical tool for the establishment of the boundedness of notoriously difficult operators (such as potentials) on certain specific types of rearrangement-invariant function spaces from analogous…
Matching is a method of the design of experiments. If we had an even number of patients and wanted to form pairs of patients such that their ages, for example, in each pair be as close as possible, we would use nonbipartite matching. Not…