Related papers: Grid homology for spatial graphs and a skein exact…
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…
A stable homology theory is defined for completely distributive CSL algebras in terms of the point-neighbourhood homology of the partially ordered set of meet-irreducible elements of the invariant projection lattice. This specialises to the…
A matching preclusion set of a graph is an edge set whose deletion results in a graph without perfect matching or almost perfect matching. The Cartesian product of $n$ paths is called an $n$-grid graph. In this paper, we study the matching…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
We explore a somewhat unexpected connection between knot Floer homology and shellable posets, via grid diagrams. Given a grid presentation of a knot K inside S^3, we define a poset which has an associated chain complex whose homology is the…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We consider an analogue of well-known Casson knot invariant for knotoids. We start with a direct analogue of the classical construction which gives two different integer-valued knotoid invariants and then focus on its homology extension.…
It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the…
We state and prove a correct version of a theorem presented in an earlier paper.
We show that the space of chains of smooth maps from spheres into a fixed compact oriented manifold has a natural structure of a transversal $d$-algebra. We construct a structure of transversal 1-category on the space of chains of maps from…
We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…
Series-parallel network topologies generally exhibit simplified dynamical behavior and avoid high combinatorial complexity. A comprehensive analysis of how flow complexity emerges with a graph's deviation from series-parallel topology is…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
Graph homologies are powerful tools to compute the rational homotopy group of the space of long embeddings. Two graph homologies have been invented from two approaches to study the space of long embeddings: the hairy graph homology from…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
We develop a method of calculation for the symplectic Floer homology of composite knots. The symplectic Floer homology of knots defined in \cite{li} naturally admits an integer graded lifting, and it formulates a filtration and induced…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…