Related papers: Graph equivariant cohomological rigidity for GKM g…
We describe two locally finite graphs naturally associated to each knot type K, called Reidemeister graphs. We determine several local and global properties of these graphs and prove that in one case the graph-isomorphism type is a complete…
In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…
Let G be a compact Lie-group, X a compact G-CW-complex. We define equivariant geometric K-homology groups K^G_*(X), using an obvious equivariant version of the (M,E,f)-picture of Baum-Douglas for K-homology. We define explicit natural…
For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…
We introduce an equivariant version of Hochschild cohomology as the deformation cohomology to study equivariant deformations of associative algebras equipped with finite group actions.
The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…
We present several approaches to equivariant intersection cohomology. We show that for a complete algebraic variety acted by a connected algebraic group $G$ it is a free module over $H^*(BG)$. The result follows from the decomposition…
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…
This paper is devoted to the construction of norm-preserving maps between bounded cohomology groups. For a graph of groups with amenable edge groups we construct an isometric embedding of the direct sum of the bounded cohomology of the…
Aim of this paper is to define a new type of cohomology for multiplicative Hom-Leibniz algebras which controls deformations of Hom-Leibniz algebra structure. The cohomology and the associated deformation theory for Hom-Leibniz algebras as…
In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…
We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
The equivariant cohomology of a space with a group action is not only a ring but also an algebra over the cohomology ring of the classifying space of the acting group. We prove that toric manifolds (i.e. compact smooth toric varieties) are…
A discussion given to the question of extending Khovanov homology from links to embedded graphs, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such graph by using some local…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.
Graphs are one of the most important data structures for representing pairwise relations between objects. Specifically, a graph embedded in a Euclidean space is essential to solving real problems, such as physical simulations. A crucial…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…