Related papers: Semistable Graph Homology
Given a Morse function on a manifold whose moduli spaces of gradient flow lines for each action window are compact up to breaking one gets a bidirect system of chain complexes. There are different possibilities to take limits of such a…
This article studies the symplectic cohomology of affine algebraic surfaces that admit a compactification by a normal crossings anticanonical divisor. Using a toroidal structure near the compactification divisor, we describe the complex…
This survey covers earlier work of the author as well as recent work on Riemann's moduli space, its canonical cell decomposition and compactification, and the related operadic structure of arc complexes.
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
Throughout this work, the vertex decomposability and shellability of graphs formed from other graphs by various operations are investigated. Also among the other things, by using some graph operations, new classes of Cohen-Macaulay graphs…
Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon…
The aim of this paper is to extend the expanded degeneration construction of Li and Wu to obtain good degenerations of Hilbert schemes of points on semistable families of surfaces, as well as to discuss alternative stability conditions and…
Massive networks have shown that the determination of dense subgraphs, where vertices interact a lot, is necessary in order to visualize groups of common interest, and therefore be able to decompose a big graph into smaller structures. Many…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
This is an expository paper extending the tutorial talk at the MATRIX Workshop on Uniqueness and Discernment in Graph Polynomials in October 2023. The explanation is mainly based on the paper "Partial Duality of Hypermaps" by S.Chmutov and…
Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a…
We construct the Hilbert compactification of the universal moduli space of semistable vector bundles over smooth curves. The Hilbert compactification is the GIT quotient of some open part of an appropriate Hilbert scheme of curves in a…
We define a deformation of our earlier link homologies for fundamental representations of sl_m. The deformed homology of a link is isomorphic to the deformed homology of the disjoint union of its components. Moreover, there exists a…
We study moduli of semistable twisted sheaves on smooth proper morphisms of algebraic spaces. In the case of a relative curve or surface, we prove results on the structure of these spaces. For curves, they are essentially isomorphic to…
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…
We consider the moduli space of flat connections on the Riemann surface with marked points. The new efficient parametrization is suggested and used to construct an integrable model on the moduli space. A family of commuting Hamiltonians is…
We study the cohomology of complexes of ordinary (non-decorated) graphs, introduced by M. Kontsevich. We construct spectral sequences converging to zero whose first page contains the graph cohomology. In particular, these series may be used…
We present a novel hierarchical graph clustering algorithm inspired by modularity-based clustering techniques. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs.…
Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…
In this paper, we introduce the concept of crossed module for Hom-Leibniz-Rinehart algebras. We study the cohomology and extension theory of Hom-Leibniz-Rinehart algebras. It is proved that there is one-to-one correspondence between…