Khovanov-Rozansky homology and directed cycles
From MaRDI portal
Publication:2408110
Abstract: We determine the cycle packing number of a directed graph using elementary projective algebraic geometry. Our idea is rooted in the Khovanov-Rozansky theory. In fact, using the Khovanov-Rozansky homology of a graph, we also obtain algebraic methods of detecting directed and undirected cycles containing a particular vertex or edge.
Recommendations
- A Hochschild-Kostant-Rosenberg theorem for cyclic homology
- scientific article; zbMATH DE number 66568
- Cyclic homology and de Rham cohomology
- On the Khovanov-Rozansky homology of graphs and links
- Homotopical Khovanov homology
- Cyclic homology and equivariant homology
- Khovanov homology
- Khovanov homology and torsion
- scientific article; zbMATH DE number 4059561
- The cyclic homology and 𝐾-theory of curves
Cites work
- A colored sl(N) homology for links in S3
- A geometric construction of colored HOMFLYPT homology
- A Minimax Theorem for Directed Graphs
- Homfly polynomial via an invariant of colored plane graphs
- scientific article; zbMATH DE number 5011327 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 3394295 (Why is no real title available?)
- Matrix factorizations and link homology
- Matrix factorizations and link homology. II.
- Projections of Grassmannians of lines and characterization of Veronese varieties
- Some differentials on Khovanov-Rozansky homology
- The 1,2-coloured HOMFLY-PT link homology
This page was built for publication: Khovanov-Rozansky homology and directed cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408110)