Related papers: Parity functors
We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete…
Numerical functions, which characterize Dynkin schemes, Coxeter graphs and tame marked quivers, are considered.
Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
The symmetry of Nature under a Space Inversion is described by a Parity operator. Contrary to popular belief, the Parity operator is not unique. The choice of the Parity operator requires several arbitrary decisions to be made. It is shown…
We define homology of ternary algebras satisfying axioms derived from particle scattering or, equivalently, from the third Reidemeister move. We show that ternary quasigroups satisfying these axioms appear naturally in invariants of…
Relative realizability toposes satisfy a universal property that involves regular functors to other categories. We use this universal property to define what relative realizability categories are, when based on other categories than of the…
A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
This note is about the topology of the path space of linear Fredholm operators on a real Hilbert space. Fitzpatrick and Pejsachowicz introduced the parity of such a path, based on the Leray-Schauder degree of a path of parametrices. Here an…
Two recent publications describe realizable Gauss diagrams using conditions stating that the number of chords in certain sets of chords is even or odd. We demonstrate that these descriptions are incorrect by finding multiple…
The equivalence test is a main part in any classification problem. It helps to prove bounds for the main parameters of the considered combinatorial structures and to study their properties. In this paper, we present algorithms for…
The first author recently introduced a "nearby cycles formalism" in the framework of chain complexes of parity sheaves. In this paper, we compute this functor in two related settings: (i) affine space, stratified by the action of a torus,…
In this paper, we establish some common fixed point results for a new class of pair of contractions mappings having functions as contractive parameters, and satisfying certain commutative properties.
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…
A correspondence functor is a functor from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring. We determine exactly which simple correspondence functors are projective. Moreover,…
An \"{u}bercrossing diagram is a knot diagram with only one crossing that may involve more than two strands of the knot. Such a diagram without any nested loops is called a petal projection. Every knot has a petal projection from which the…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
A homogeneous knot is a generalization of alternating knots and positive knots. We determine the Rasmussen invariant of a homogeneous knot. This is a new class of knots such that the Rasmussen invariant is explicitly described in terms of…