Related papers: Double graph complex and characteristic classes of…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…
The double graph of a graph $G$ is defined as $\mathcal{D}[G]$ = $G \times T_2$, where \(T_2\) is the total graph with 2 vertices and $\times$ stands for the Kronecker product of graphs. In this paper, sufficient conditions for double…
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have been made to provide accurate models. We study here a model…
We construct characteristic classes of smooth (Hamiltonian) fibrations as as fiber integrals of products of Pontriagin (or Chern) classes of vertical vector bundles over the total space of the universal fibration. We give explicit formulae…
Graphs are general and powerful data representations which can model complex real-world phenomena, ranging from chemical compounds to social networks; however, effective feature extraction from graphs is not a trivial task, and much work…
Every compact symplectic 4-manifold can be realized as a branched cover of the complex projective plane branched along a symplectic curve with cusp and node singularities; the covering map is induced by a triple of sections of a "very…
In this paper, we construct new characteristic classes of fiber bundles via flat connections with values in infinite-dimensional Lie algberas of derivations. In fact, choosing a fiberwise metric, we construct a chain map to the de Rham…
Bifiltered graphs are a versatile tool for modelling relations between data points across multiple grades of a two-dimensional scale. They are especially popular in topological data analysis, where the homological properties of the induced…
Let p be a singular point of a variety. Consider a resolution where the preimage of p is a simple normal crossing divisor E. The combinatorial structure of E is described by a cell complex D(E), called the dual graph or dual complex of E.…
This paper studies the interplay between self-crossing boundary Lefschetz fibrations and generalized complex structures. We show that these fibrations arise from the moment maps in semi-toric geometry and use them to construct self-crossing…
Let $D$ be a multidigraph. We study the simplicial complex $\mathrm{Dlf}(D)$, whose vertices are the directed edges of $D$ and whose faces correspond to directed linear forests, that is, vertex-disjoint unions of directed paths. We also…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
We introduce the notion of strip complex. A strip complex is a special type of complex obtained by gluing "strips" along their natural boundaries according to a given graph structure. The most familiar example is the one dimensional complex…
We investigate fibrations by non-hyperelliptic curves of arithmetic genus three and geometric genus one in characteristic two. Assuming that there is only one moving singularity and that its image in the Frobenius pullback of the fibration…
A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…
We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed…
The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…