Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

73145218290 · Jun 202019922001200920172026
48 results for graph homology

We study the hairy graph homology of a cyclic operad; in particular we show how to assemble corresponding hairy graph cohomology classes to form cocycles for ordinary graph homology, as defined by Kontsevich. We identify the part of hairy graph homology coming from graphs with cyclic fundamental group as the dihedral h…

2013-08-18abs ↗pdf ↗

Grid homology properties for MOY graphs studied.

problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.

Extends knot concordance invariant to balanced spatial graphs using grid homology.

problem Defining a concordance invariant for balanced spatial graphs.
method Using grid homology to extend the invariant from knots to spatial graphs.
result The combinatorial ΥΥ invariant is a concordance invariant for balanced spatial graphs.

The paper studies grid homology for spatial graphs and proves a Künneth formula for connected sums.

problem Understanding grid homology for spatial graphs with various types of edges.
method Developed grid homology for spatial graphs with cut edges and applied it to prove a Künneth formula for connected sums.
result A Künneth formula for knot Floer homology of connected sums is proven using grid homology.

The paper extends a knot invariant to graphs and connects it to homology cylinders.

problem Understanding the structure of homology cobordism groups.
method Using tangle Floer homology, the authors define a new invariant for embedded graphs and prove a concatenation formula.
result The new invariant induces a homomorphism on the homology cobordism group of homology cylinders.

Persistent homology enhances graph classification by capturing long-range graph properties.

problem Lack of formal assessment of persistent homology in graph learning.
method Brief introduction and theoretical discussion of persistent homology in graph context, followed by empirical analysis.
result Persistent homology improves graph classification, especially for data with prominent topological structures.

J. Przytycki has established a connection between the Hochschild homology of an algebra AA and the chromatic graph homology of a polygon graph with coefficients in AA. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a …

2010-01-29abs ↗pdf ↗

Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane graphs, we show that our chromatic homology can be recovered from the Khovanov h…

2005-11-22abs ↗pdf ↗

We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also present a spanning quasi-tree model for the Khovanov homology of a ribbon graph.

2011-07-12abs ↗pdf ↗

In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with graded Euler characteristic equal to the Jones polynomial of the link. Hence, it can…

2006-05-22abs ↗pdf ↗

Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve the bounds for the homological span of chromatic homology by Helme-Guizon, Przy…

2018-01-04abs ↗pdf ↗

We generalize the construction of the Heegaard Floer homology for a singular knot to that for a balanced bipartite graph. For a given graph, we provide a combinatorial description of the Euler characteristic of its Heegaard Floer homology by using the "Kauffman states" on a graph diagram.

2014-01-26abs ↗pdf ↗

New homology theory for graphs detects subdivisions and homology manifolds.

problem Defining a dissimilarity metric for graphs.
method Filtration on simplicial homology, using bi-colourings of vertices.
result The überhomology vanishes in lowest degree for subdivisions and coincides with fundamental class for homology manifolds.

The paper calculates asymptotic Betti numbers and homology multiplicities for graph configuration spaces.

problem Understanding the homology of ordered configuration spaces of graphs.
method Explicit formulas for asymptotic Betti numbers and homology multiplicities in characteristic zero.
result Explicit formulas for asymptotic multiplicities in homology of irreducible representations of the symmetric group.

Researchers determined the second homology group of a specific symplectic derivation Lie algebra.

problem Determining the entire homology group of a specific symplectic derivation Lie algebra.
method Used classical representation theory of Sp(2g; Q) and weight decomposition.
result Determined H_2(\mathfrak{c}_g^{+})

We construct maps on hat Heegaard Floer homology for cobordisms decorated with graphs. The graph TQFT allows for cobordisms with disconnected ends. Our construction uses Juhász's sutured Floer TQFT. We compute the maps for several elementary graph cobordisms. As an application, we compute the action of the fundamental …

2015-03-19abs ↗pdf ↗

Kronheimer-Mrowka's instanton homology dimension equals Tait colorings.

problem Calculating the dimension of a specific homology group for plane trivalent graphs.
method Using SO(3) instanton Floer homology, the dimension is shown to be equal to the number of Tait colorings.
result The dimension of J#(G) is equal to the number of Tait colorings of G.

We show that a graph manifold which is a Z-homology 3-sphere not homeomorphic to either the 3-sphere or the Poincaré homology 3-sphere admits a horizontal foliation. This combines with known results to show that the conditions of not being an L-space, of having a left-orderable fundamental group, and of admitting a co-…

2013-03-21abs ↗pdf ↗

Characterizes a specific homology group for certain graphs.

problem Understanding the first uniformly finite homology group with Z\mathbb{Z} coefficients.
method Analyzes uniformly locally finite graphs, characterizes the group for trees and Z2\mathbb{Z}_2 coefficients, and identifies three phenomena for general graphs.
result Necessary conditions for non-vanishing of the group in transitive graphs.

We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a (2,n)(2,n)-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov homology. In the classical case of Khovanov homology we prove the concrete connectio…

2005-09-14abs ↗pdf ↗

The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks are included.

2010-12-16abs ↗pdf ↗

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram LL, there is an associated ribbon graph whose quasi-trees correspond bijectively to …

2007-05-23abs ↗pdf ↗

The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of contact between geometric group theory and quantum topology. In this paper we give…

2003-07-28abs ↗pdf ↗

Study Brieskorn spheres using Floer homology, generating infinite rank summands in homology cobordism.

problem Computing Heegaard Floer homologies of Brieskorn spheres.
method Floer theoretic invariants of Dai, Hom, Stoffregen, and Truong.
result Brieskorn spheres generate infinite rank summands in the homology cobordism group.

New TQFT homologies help color graphs, potentially solving the four color theorem.

problem Graph coloring problem, especially the four color theorem.
method Topological quantum field theory (TQFT) to define homology theories.
result TQFT homologies can generate 4-face colorings of bridgeless planar graphs, offering a constructive approach to the four color theorem.

We construct a graph TQFT for the minus flavor of Heegaard Floer homology. Our graph TQFT extends Ozsváth and Szabó's TQFT for closed and connected 3-manifolds, and allows for cobordisms with disconnected ends. As an application, we give an explicit formula for the chain homotopy type of the π1π_1-action on Heegaard Fl…

2015-12-03abs ↗pdf ↗

A graph multilink is a link with multiplicities in a homology 3-sphere whose exterior is a graph manifold. In this Note, we compute the Novikov homology of graph multilinks. As a corollary, we give a majoration for the number of Novikov modules on a given graph link.

2004-06-09abs ↗pdf ↗

We show that the knot lattice homology of a knot in an L-space is equivalent to the knot Floer homology of the same knot (viewed these invariants as filtered chain complexes over the polynomial ring Z/2Z [U]). Suppose that G is a negative definite plumbing tree which contains a vertex w such that G-w is a union of rati…

2012-07-17abs ↗pdf ↗