Related papers: Graph equivariant cohomological rigidity for GKM g…

In this article, we introduce equivariant formal deformation theory of associative algebra morphisms. We introduce an equivariant deformation cohomology of associative algebra morphisms and using this we study the equivariant formal…

Let $G$ be a graph on $n$ vertices. An induced subgraph $H$ of $G$ is called heavy if there exist two nonadjacent vertices in $H$ with degree sum at least $n$ in $G$. We say that $G$ is $H$-heavy if every induced subgraph of $G$ isomorphic…

In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…

For manifolds equipped with group actions, we have the following natural question: To what extent does the equivariant cohomology determine the equivariant diffeotype? We resolve this question for Hamiltonian circle actions on compact,…

We describe a generalization of GKM theory for actions of arbitrary compact connected Lie groups. To an action satisfying the non-abelian GKM conditions we attach a graph encoding the structure of the non-abelian 1-skeleton, i.e., the…

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…

Suppose we are given two graphs on $n$ vertices. We define an observable in the Hilbert space $\Co[(S_n \wr S_2)^m]$ which returns the answer ``yes'' with certainty if the graphs are isomorphic and ``no'' with probability at least…

In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…

We prove that two horizontal-strip LLT polynomials are equal if the associated weighted graphs defined by the author in a previous paper are isomorphic. This provides a sufficient condition for equality of horizontal-strip LLT polynomials…

Let $\A$ and $\B$ be operator algebras with $c_0$-isomorphic diagonals and let $\K$ denote the compact operators. We show that if $\A\otimes\K$ and $\B\otimes\K$ are isometrically isomorphic, then $\A$ and $\B$ are isometrically isomorphic.…

Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…

We investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

For a finite group $\Gamma$, acting on a finite group $G,$ we find necessary conditions for which the first $\Gamma_0$-equivariant Hochschild cohomology of the group algebra $kG$ is non-trivial, where $k$ is a field of characteristic $p$…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

We prove that two quiver operator algebras can be isometrically isomorphic only if the quivers (=directed graphs) are isomorphic. We also show how the graph can be recovered from certain representations of the algebra.

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…