Related papers: Graph Equivalence Classes for Spectral Projector-B…

Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…

We classify, up to isomorphism, the 2-dimensional algebras over a field K. We focuse also on the case of characteristic 2, identifying the matrices of GL(2,F_2) with the elements of the symmetric group S_3. The classification is then given…

We argue that Transformers are essentially graph-to-graph models, with sequences just being a special case. Attention weights are functionally equivalent to graph edges. Our Graph-to-Graph Transformer architecture makes this ability…

In this work, we explore the interplay between graph limit theory, the geometry of underlying probability spaces, spectral theory, and network dynamical systems. We investigate two primary questions concerning forward and inverse…

We investigate the factorization problem as well as the classifying complements problem in the setting of Jordan algebras. Matched pairs of Jordan algebras and the corresponding bicrossed products are introduced. It is shown that any Jordan…

We show that a map between projection lattices of semi-finite von Neumann algebras can be extended to a Jordan $*$-homomorphism between the von Neumann algebras if this map is defined in terms of the support projections of images (under the…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

In this work we target the problem of provably computing the equivalence between two programs represented as dataflow graphs. To this end, we formalize the problem of equivalence between two programs as finding a set of semantics-preserving…

We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e., types of layering). In developing this generalization, we identify multiple types of isomorphisms. For example, in multilayer networks…

An idempotent in a Jordan algebra induces a Peirce decomposition of the algebra into subspaces whose pairwise multiplication satisfies certain fusion rules $\Phi(\frac{1}{2})$. On the other hand, $3$-transposition groups $(G,D)$ can be…

We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…

We propose an end-to-end deep learning learning model for graph classification and representation learning that is invariant to permutation of the nodes of the input graphs. We address the challenge of learning a fixed size graph…

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring…

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

A basic problem for any class of nonassociative algebras is to determine the polynomial identities satisfied by the symmetrization and the skew-symmetrization of the original product. We consider the symmetrization of the product in the…

This paper presents a new graph isomorphism invariant, called $\mathfrak{w}$-labeling, that can be used to design a polynomial-time algorithm for solving the graph isomorphism problem for various graph classes. For example, all…

Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…

In this paper, we classify four-dimensional Jordan algebras over an algebraically closed field of characteristic different of two. We establish the list of 73 non-isomorphic Jordan algebras.

In many network problems, graphs may change by the addition of nodes, or the same problem may need to be solved in multiple similar graphs. This generates inefficiency, as analyses and systems that are not transferable have to be…