Related papers: The generalized Yamada polynomials of virtual spat…
Generalized splines are a simultaneous generalization of GKM theory -- which studies equivariant cohomology -- and classical splines, which provide piecewise approximations of functions. Generalized splines can also be understood via…
In this paper, we define the notion of a virtually symmetric representation of representations of virtual braid groups and prove that many known representations are equivalent to virtually symmetric. Using one such representation, we define…
By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…
It is a standard result that the integral curves of an auto-parallel vector field are geodesics which, for null and timelike vectors, are the paths of freely-falling particles in general relativity. We introduce a definition of an…
Two welded (respectively virtual) link diagrams are homotopic if one may be transformed into the other by a sequence of extended Reidemeister moves, classical Reidemeister moves, and self crossing changes. In this paper, we extend Milnor's…
Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short)…
A new approach to the study of Generalized Graphs as semantic data structures using machine learning techniques is presented. We show how vector representations maintaining semantic characteristics of the original data can be obtained from…
We generalize the natural duality of graphs embedded into a surface to a duality with respect to a subset of edges. The dual graph might be embedded into a different surface. We prove a relation between the signed Bollobas-Riordan…
By constructing jointly a random graph and an associated exploration process, we define the dynamics of a "parking process" on a class of uniform random graphs as a measure-valued Markov process, representing the empirical degree…
Spatial autocorrelation and spatial heterogeneity widely exist in spatial data, which make the traditional machine learning model perform badly. Spatial domain generalization is a spatial extension of domain generalization, which can…
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…
A virtual link diagram is called {\em (mod $m$) almost classical} if it admits a (mod $m$) Alexander numbering. In \cite{BodenGaudreauHarperNicasWhite}, it is shown that Alexander polynomial for almost classical links can be defined by…
This paper studies rotational virtual knot theory and its relationship with quantum link invariants. Every quantum link invariant for classical knots and links extends to an invariant of rotational virtual knots and links. The paper sets up…
Building further on work of Marin and Wagner, we give a cubic braid-type skein theory of the Links--Gould polynomial invariant of oriented links and prove that it can be used to evaluate any oriented link, adding this polynomial to the list…
Kishino's knot is not detected by the fundamental group or the bracket polynomial; these invariants cannot differentiate between Kishino's knot and the unknot. However, we can show that Kishino's knot is not equivalent to unknot by applying…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…
Let R be a commutative ring with identity. An edge labeled graph is a graph with edges labeled by ideals of R. A generalized spline over an edge labeled graph is a vertex labeling by elements of R, such that the labels of any two adjacent…