Related papers: On the intersection ring of graph manifolds
Let $V$ be a left $R$-module where $R$ is a (not necessarily commutative) ring with unit. The intersection graph $\cG(V)$ of proper $R$-submodules of $V$ is an undirected graph without loops and multiple edges defined as follows: the vertex…
We study smooth isotopy classes of complex curves in complex surfaces from the perspective of the theory of bridge trisections, with a special focus on curves in $\mathbb{CP}^2$ and $\mathbb{CP}^1\times\mathbb{CP}^1$. We are especially…
Let $M=G/H$ be a Riemannian homogeneous space, where $G$ is a compact Lie group with closed subgroup $H$. Classical intersection theory states that the de Rham cohomology ring of $M$ describes the signed count of intersection points of…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
We study rationality problems for smooth complete intersections of two quadrics. We focus on the three-dimensional case, with a view toward understanding the invariants governing the rationality of a geometrically rational threefold over a…
We demonstrate how by using the intersection theory to calculate the cohomology of $G_2$-manifolds constructed by using the generalized Kummer construction. For one example we find the generators of the rational cohomology ring and describe…
A generalization of the formula of Fine and Rao for the ranks of the intersection homology groups of a complex algebraic variety is given. The proof uses geometric properties of intersection homology and mixed Hodge theory.
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
The manuscript considers mathematical models for creating a topological drawing of a graph based on the methods of G. Ringel's vertex rotation theory. An algorithm is presented for generating a topological drawing of a flat part of a graph…
We use topological quantum field theory to derive an invariant of a three-manifold with boundary. We then show how to use this invariant as an obstruction to embedding one three-manifold in another.
We present an algorithm to compute path homology for simple digraphs, and use it to topologically analyze various small digraphs en route to an analysis of complex temporal networks which exhibit such digraphs as underlying motifs. The…
In this paper, we introduce a new method to compute magnitude homology of general graphs. To each direct sum component of magnitude chain complexes, we assign a pair of simplicial complexes whose simplicial chain complex is isomorphic to…
We construct an explicit de Rham isomorphism relating the cohomology rings of Banagl's de Rham and spatial approach to intersection space cohomology for stratified pseudomanifolds with isolated singularities. Intersection space…
Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…