Related papers: Core groups

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…

We introduce the multiplexing of a crossing, replacing a classical crossing of a virtual link diagram with multiple crossings which is a mixture of classical and virtual. For integers $m_{i}$ $(i=1,\ldots,n)$ and an ordered $n$-component…

In 2014 Andrey Perfiliev introduced the so-called electric invariant for non-oriented knots. This invariant was motivated by using Kirchhoff's laws for the dual graph of the knot diagram. Later, in 2020, Anastasiya Galkina generalised this…

Let $\Gamma_g$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We introduce a combinatorial structure of "core surfaces", that represent subgroups of $\Gamma_g$. These structures are (usually)…

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…

A polynomial invariant of virtual links, arising from an invariant of links in thickened surfaces introduced by Jaeger, Kauffman, and Saleur, is defined and its properties are investigated. Examples are given that the invariant can detect…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

Cross-connections of normal categories was introduced by K.S.S.Nambooripad while discussing the structure of regular semigroups and via this cross-connections he obtained a beautiful representetion of regualr semigroup called the…

Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…

Group presentations are implicit descriptions of 2-dimensional cell complexes with only one vertex. While such complexes are usually sufficient for topological investigations of groups, multi-vertex complexes are often preferable when the…

In the present paper, we define an invariant of free links valued in a free product of some copies of $\mathbb{Z}_{2}$. In \cite{Ma2} the second named author constructed a connection between classical braid group and group presentation…

The Witten-Reshetikhin-Turaev invariant of classical link diagrams is generalized to virtual link diagrams. This invariant is unchanged by the framed Reidemeister moves and the Kirby calculus. As a result, it is also an invariant of the…

An inverse Clifford semigroup (often referred to as just a Clifford semigroup) is a semilattice of groups. It is an inverse semigroup and in fact, one of the earliest studied classes of semigroups. In this short note, we discuss various…

The set of isotopy classes of ordered n-component links in the 3-sphere is acted on by the symmetric group via permutation of the components. The intrinsic symmetry group of the link, S(L), is defined to be the set of elements in the…

We generalize the theory of critical groups from graphs to simplicial complexes. Specifically, given a simplicial complex, we define a family of abelian groups in terms of combinatorial Laplacian operators, generalizing the construction of…

We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…

An arithmetical structure on a finite, connected graph without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there is a divisor of the sum of the integers at adjacent vertices,…

A heap is a set with a certain ternary operation that is self-distributive (TSD) and exemplified by a group with the operation $(x,y,z)\mapsto xy^{-1}z$. We introduce and investigate framed link invariants using heaps. In analogy with the…

Let $G$ be a finite group and let $\tilde{G}$ be a Schur cover of $G$. The deep commuting graph $\Delta_D(G)$ of $G$ is a simple graph with vertex set $G$, where two distinct vertices are adjacent if their pre-images commute in $\tilde{G}$.…