Related papers: Differentials on Forested and Hairy Graph Complexe…
We describe explicitly the cohomology of the total complex of certain diagrams of invertible sheaves on normal toric varieties. These diagrams, called wheels, arise in the study of toric singularities associated to dimer models. Our main…
We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous…
Given a graph $G$ and a target graph $H$, an $H$-coloring of $G$ is an adjacency-preserving vertex map from $G$ to $H$. The number of $H$-colorings of $G$, $\hom(G,H)$, has been studied for many classes of $G$ and $H$. In particular,…
For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a…
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…
We give a definition of differentiable cohomology of a Lie group G (possibly infinite-dimensional) with coefficients in any abelian Lie group. This differentiable cohomology maps both to the cohomology of the group made discrete and to Lie…
We construct a canonical map from the Poisson vertex algebra cohomology complex to the differential Harrison cohomology complex, which restricts to an isomorphism on the top degree. This is an important step in the computation of Poisson…
We compute the cohomology groups of the spaces of colorings of cycles, i.e., of the prodsimplicial complexes Hom(C_m,K_n). We perform the computation first with Z_2, and then with integer coefficients. The main technical tool is to use…
Color refinement is an important technique that works very well in practice for the graph isomorphism problem. Tinhofer graphs are the class of graphs for which refinement together with individualization correctly tests graph isomorphism…
In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most $k$, when an effective…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…
Let $M$ be a left $R$-module. We define the \emph{homomorphism submodule graph} $\Gamma_{\mathrm{Hom}}(M)$ as the simple graph whose vertices are the proper submodules of $M$, with an edge between distinct vertices $N_1$ and $N_2$ if and…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…
The Weisfeiler-Lehman graph kernels are among the most prevalent graph kernels due to their remarkable time complexity and predictive performance. Their key concept is based on an implicit comparison of neighborhood representing trees with…
Digraph-defined external difference families were recently introduced as a natural generalization of several well-studied combinatorial objects motivated by cryptography (e.g. external difference families (EDFs) and circular external…
The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…
In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility…