Related papers: Obstruction Complexes in Grid Homology
A knot in a solid torus defines a map on the set of (smooth or topological) concordance classes of knots in $S^3$. This set admits a group structure, but a conjecture of Hedden suggests that satellite maps never induce interesting…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
We define an infinite family of linearly independent, integer-valued smooth concordance homomorphisms. Our homomorphisms are explicitly computable and rely on local equivalence classes of knot Floer complexes over the ring $\mathbb{F}[U,…
This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows…
Ozsvath and Szabo gave a combinatorial description of knot Floer homology based on a cube of resolutions, which uses maps with twisted coefficients. We study the t=1 specialization of their construction. The associated spectral sequence…
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
We demonstrate an isomorphism between the homology of the strand algebra of bordered Floer homology, and the category algebra of the contact category introduced by Honda. This isomorphism provides a direct correspondence between various…
We develop persistent homology in the setting of filtrations of (Cech) closure spaces. Examples of filtrations of closure spaces include metric spaces, weighted graphs, weighted directed graphs, and filtrations of topological spaces. We use…
We show that there is an hierarchy of intersection rigidity properties of sets in a closed symplectic manifold: some sets cannot be displaced by symplectomorphisms from more sets than the others. We also find new examples of rigidity of…
We give an $O(n^2(k+\log n))$ algorithm for computing the $k$-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on $n$ vertices. This is nearly quadratic in the number of vertices $n$, and therefore a…
We showed that the order of torsion homology classes in the grid homology of a knot is a lower bound for the unknotting number.
We define a new smooth concordance homomorphism based on the knot Floer complex and an associated concordance invariant, epsilon. As an application, we show that an infinite family of topologically slice knots are independent in the smooth…
We show that the homology of ordered configuration spaces of finite trees with loops is torsion free. We introduce configuration spaces with sinks, which allow for taking quotients of the base space. Furthermore, we give a concrete…
Building on work of Brandt and Terao in their study of $k$-formality, we introduce a co-chain complex associated to a multi-arrangement and prove that its cohomologies determine freeness of the associated module of multi-derivations. This…
We give a construction of the Floer homology of the pair of {\it non-compact} Lagrangian submanifolds, which satisfies natural continuity property under the Hamiltonian isotopy which moves the infinity but leaves the intersection set of the…
We calculate the Heegaard Floer homologies for three-manifolds obtained by plumbings of spheres specified by certain graphs. Our class of graphs is sufficiently large to describe, for example, all Seifert fibered rational homology spheres.…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
In this paper, we construct a Hamiltonian Floer theory based invariant called relative symplectic cohomology, which assigns a module over the Novikov ring to compact subsets of closed symplectic manifolds. We show the existence of…