Related papers: The generalized Yamada polynomials of virtual spat…
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…
Topological deep learning is a rapidly growing field that pertains to the development of deep learning models for data supported on topological domains such as simplicial complexes, cell complexes, and hypergraphs, which generalize many…
In this paper we discuss how to define a chord index via smoothing a real crossing point of a virtual knot diagram. Several polynomial invariants of virtual knots and links can be recovered from this general construction. We also explain…
Virtual knot theory has experienced a lot of nice features that did not appear in classical knot theory, e.g., parity and picture-valued invariants. In the present paper we use virtual knot theory effects to construct new representations of…
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
A theory of graded manifolds can be viewed as a generalization of differential geometry of smooth manifolds. It allows one to work with functions which locally depend not only on ordinary real variables, but also on $\mathbb{Z}$-graded…
We generalize the classical study of Alexander polynomials of smooth or PL locally-flat knots to PL knots that are not necessarily locally-flat. We introduce three families of generalized Alexander polynomials and study their properties.…
Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…
Learning graphs from sets of nodal observations represents a prominent problem formally known as graph topology inference. However, current approaches are limited by typically focusing on inferring single networks, and they assume that…
A virtual link is a generalization of a classical link that is defined as an equivalence class of certain diagrams, called virtual link diagrams. It is further generalized to a twisted link. Twisted links are in one-to-one correspondence…
We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte…
The connected sum of two flat virtual knots depends on the choice of diagrams and basepoints. We show that any minimal crossing diagram of a composite flat virtual knot is a connected sum diagram. We also show the crossing number of flat…
The $M$-polynomial was introduced by Deutsch and Klav\v{z}ar in 2015 as a graph polynomial to provide an easy way to find closed formulas of degree-based topological indices, which are used to predict physical, chemical, and pharmacological…
Motivated by studies of oscillator networks, we study the spectrum of the join of several normal matrices with constant row sums. We apply our results to compute the characteristic polynomial of the join of several regular graphs. We then…
We generalize the Wriggle polynomial, first introduced by L. Folwaczny and L. Kauffman, to the case of virtual tangles. This generalization naturally arises when considering the self-crossings of the tangle. We prove that the generalization…
Geometric interpretations of some virtual knot invariants are given in terms of invariants of links in $\mathbb{S}^3$. Alexander polynomials of almost classical knots are shown to be specializations of the multi-variable Alexander…
A virtual knot is an equivalence class of embeddings of $ S^1 $ into thickened (closed oriented) surfaces, up to self-diffeomorphism of the surface and certain handle stabilisations. The slice genus of a virtual knot is defined…
The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…
The machinery of zonotopal algebra is linked with two particular polytopes: the Stanley-Pitman polytope and the regular simplex $\mathfrak{Sim}_n(t_1,...,t_n)$ with parameters $t_1,...,t_n\in \mathbb{R}_+^n$, defined by the inequalities…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…