Related papers: Homotopy on spatial graphs and generalized Sato-Le…
We introduce a refinement of Bar-Natan homology for involutive links, extending the work of Lobb-Watson and Sano. We construct a new suite of numerical invariants and derive bounds for the genus of equivariant cobordisms between strongly…
Two links are link-homotopic if they are transformed into each other by a sequence of self-crossing changes and ambient isotopies. The link-homotopy classes of 4-component links were classified by Levine with enormous algebraic…
We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…
We consider invariant covariant derivatives on reductive homogeneous spaces corresponding to the well-known invariant affine connections. These invariant covariant derivatives are expressed in terms of horizontally lifted vector fields on…
We introduce a spatial graph and hypergraph model that smoothly interpolates between a graph with purely pairwise edges and a graph where all connections are in large hyperedges. The key component is a spatial clustering resolution…
The theory of link-homotopy, introduced by Milnor, is an important part of the knot theory, with Milnor's mu-bar-invariants being the basic set of link-homotopy invariants. Skein relations for knot and link invariants played a crucial role…
We begin the study the algebraic topology of semi-coarse spaces, which are generalizations of coarse spaces that enable one to endow non-trivial `coarse-like' structures to compact metric spaces, something which is impossible in coarse…
Analytic lattice cohomology is a new invariant of reduced curve singularities. In the case of plane curves, it is an algebro-geometric analogue of Heegaard Floer Link homology. However, by the rigidity of the analytic structure, lattice…
A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…
Symplectic Khovanov homology is an invariant of oriented links defined by Seidel and Smith and conjectured to be isomorphic to Khovanov homology. I define morphisms (up to a global sign ambiguity) between symplectic Khovanov homology…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
In the first part of this paper, we consider, in the context of an arbitrary hyperplane arrangement, the map between compactly supported cohomology to the usual cohomology of a local system. A formula (i.e., an explicit algebraic de Rham…
Link-homotopy and self Delta-equivalence are equivalence relations on links. It was shown by J. Milnor (resp. the last author) that Milnor invariants determine whether or not a link is link-homotopic (resp. self Delta-equivalent) to a…
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…
A heterogeneous graph consists of different vertices and edges types. Learning on heterogeneous graphs typically employs meta-paths to deal with the heterogeneity by reducing the graph to a homogeneous network, guide random walks or capture…
We prove the existence of a polynomial invariant that satisfies the HOMFLY skein relation for links in a lens space. In the process we also develop a skein theory of toroidal grid diagrams in a lens space.
The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…