Related papers: Dual graphs of exceptional divisors

We introduce the notion of smooth cell complexes and its subclass consisting of gathered cell complexes within the category of diffeological spaces (cf. Definitions 1 and 3). It is shown that the following hold. (1) With respect to the…

We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the…

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

If $G$ has $4$-periodic cohomology, then D2 complexes over $G$ are determined up to polarised homotopy by their Euler characteristic if and only if $G$ has at most two one-dimensional quaternionic representations. We use this to solve…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…

Let $A$ be a commutative noetherian ring, containing a field $k$, with $1/2\in k$, $\dim A=d$, and let $P$ be a projective $A$-module or $rank(P)=n$. In continuation of \cite{MM}, we study Homotopy obstructions for $P$ to split off a free…

In the work of C. Donovan and N. A. Scoville, the homotopy type of the Morse complex of the extended star graph which is obtained as the one-point union of n paths of length 2 was determined by using star clusters and Cluster Lemma. In this…

Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…

We show that the dominance complex $\mathcal{D}(G)$ of a graph $G$ coincides with the combinatorial Alexander dual of the neighborhood complex $\mathcal{N}(\overline{G})$ of the complement of $G$. Using this, we obtain a relation between…

We show that the rational homotopy type of the complement of a toric arrangement is completely determined by two sets of combinatorial data. This is obtained by introducing a differential graded algebra over Q whose minimal model is…

We provide combinatorial/topological formula for the multiplicity of a complex analytic normal surface singularity whenever the analytic structure on the fixed topological type is generic.

In \cite{TY}, we investigate the pair $(P, \Supp(P))$ of minimal path $P$ and its supporting sub-digraph $\Supp(P)$ in the path complex of a digraph $G$ under the strongly regular condition. In this paper, first, we consider the special…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

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…

We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…

To a digraph with a choice of certain integral basis, we construct a CW complex, whose integral singular cohomology is canonically isomorphic to the path cohomology of the digraph as introduced in \cite{GLMY}. The homotopy type of the CW…

A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…

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…

The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…