Related papers: Homomorphisms of connectome graphs
Let $\mathcal A$ and $\mathcal B$ be two (complex) algebras. A linear map $\phi:{\mathcal A}\to{\mathcal B}$ is called $n$-homomorphism if $\phi(a_{1}... a_{n})=\phi(a_{1})...\phi(a_{n})$ for each $a_{1},...,a_{n}\in{\mathcal A}.$ In this…
We give a complete diffeomorphism classification of 1-connected manifolds (of dimension different from 4) whose integral homology is H(M)=Z+Z+Z.
We define a relative version of contact homology for contact manifolds with convex boundary, and prove basic properties of this relative contact homology. Similar considerations also hold for embedded contact homology.
We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.
In this paper, we extend the definition of cohomology associated to monotone graph properties, to encompass twisted functor coefficients. We introduce oriented matchings on graphs, and focus on their (twisted) cohomology groups. We…
We consider a few types of bounded homomorphisms on a topological group. These classes of bounded homomorphisms are, in a sense, weaker than the class of continuous homomorphisms. We show that with appropriate topologies each class of these…
Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…
We characterise gaps in the full homomorphism order of graphs.
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
We define what we call morphisms of Cartan connections. We generalize the main theorems on Cartan connections to theorems on morphisms. Many of the known constructions involving Cartan connections turn out to be examples of morphisms. We…
A connection-like objects, termed {\em hom-connections} are defined in the realm of non-commutative geometry. The definition is based on the use of homomorphisms rather than tensor products. It is shown that hom-connections arise naturally…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
We study topological properties of the graph topology.
The purpose of this paper is to study deformation theory of Hom-associative algebra morphisms and Hom-Lie algebra morphisms. We introduce a suitable cohomology and discuss Infinitesimal deformations, equivalent deformations and…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…