Related papers: Parity functors
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
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…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Let $q$ be an odd prime, $m$ a positive integer, and let $\Ga_m(q)$ be the group generated by two elements $x$ and $y$ subject to the relations $x^{2m}=y^{qm}=1$ and $x^2=y^q$; that is, $\Ga_m(q)$ is the free product of two cyclic groups of…
For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…
In this study of the Reidemeister moves within the classical knot theory, we focus on hard diagrams of knots and links, categorizing them as either rigid or shaky based on their adaptability to certain moves. We establish that every link…
Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…
In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand…
In this work, the commutator of any two reasonable functions of several pairs of canonical conjugate operators is obtained as a sum of terms of partial derivatives of those functions (equations 9, 10 or 11). When applied to quantum…
A knotted ribbon is one of physical aspect of a knot. A folded ribbon knot is a depiction of a knot obtained by folding a long and thin rectangular strip to become flat. The ribbonlength of a knot type can be defined as the minimum length…
A knot K is the resultant of a knot H if there exists a minimal crossing diagram D of K such that some crossings of D can be altered to produce H. K is fertile if every prime knot H with crossing number less than c(K) is a resultant of K. K…
A criterion for comonadicity of the extension-of- scalars functor associated to an extension of (not necessarily commutative) rings is given. As an application of this criterion, some known results on the comonadicity of such functors are…
There is a positive constant $c_1$ such that for any diagram $D$ representing the unknot, there is a sequence of at most $2^{c_1 n}$ Reidemeister moves that will convert it to a trivial knot diagram, $n$ is the number of crossings in $D$. A…
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…
The object of this short note is to prove a theorem and present a conjecture for the number of even entries in the character table of the symmetric group.
In the recently introduced model of fair partitioning of friends, there is a set of agents located on the vertices of an underlying graph that indicates the friendships between the agents. The task is to partition the graph into $k$…
The parity type of a Latin square is defined in terms of the numbers of even and odd rows and columns. It is related to an Alon-Tarsi-like conjecture that applies to Latin squares of odd order. Parity types are used to derive upper bounds…
The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite…
We establish a set of relations between several quite diverse types of weighted inequalities involving various integral operators and fairly general quasinorm-like functionals which we call sub-monotone. The main result enables one to solve…