Related papers: Algebras, graphs and thetas

Evolution algebras are a special class of non-associative algebras exhibiting connections with different fields of Mathematics. Hilbert evolution algebras generalize the concept through a framework of Hilbert spaces. This allows to deal…

We define an ultragraph, which is a generalization of a directed graph, and describe how to associate a C*-algebra to it. We show that the class of ultragraph algebras contains the C*-algebras of graphs as well as the Exel-Laca algebras. We…

I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

In recent years, continual learning (CL) techniques have made significant progress in learning from streaming data while preserving knowledge across sequential tasks, particularly in the realm of euclidean data. To foster fair evaluation…

In the theory of dense graph limits, a graphon is a symmetric measurable function $W:[0,1]^2\to [0,1]$. Each graphon gives rise naturally to a random graph distribution, denoted $\mathbb{G}(n,W)$, that can be viewed as a generalization of…

We propose a general framework for quantum walks on d-dimensional spaces. We investigate asymptotic behavior of these walks. Among them, existence of limit distribution of homogeneous walks is proved. In this theorem, the support of the…

Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…

In this paper, we develop a diamond graph theory and apply the theory to the (co)homology of the Lie algebra generated by positive systems of the classical semi-simple Lie algebras over the field of complex numbers. As an application, we…

For integers $k \geq 2$ and $n \geq k+1$, we prove the following: If $n\cdot k$ is even, there is a connected $k$-regular graph on $n$ vertices. If $n\cdot k$ is odd, there is a connected nearly $k$-regular graph on $n$ vertices.

Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…

We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$. We also show…

We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…

In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We consider isomorphism of controllable graphs and cospectrality of distance-regularized graphs (which are known to be distance-regular or distance-biregular) in relation to logical definability. While most characterizations of these…

We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…

We introduce a new class of C^*-algebras, which is a generalization of both graph algebras and homeomorphism C^*-algebras. This class is very large and also very tractable. We prove the so-called gauge-invariant uniqueness theorem and the…

Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…

The Hochschild and (cotriple) cyclic homologies of crossed modules of (not-necessarily-unital) associative algebras are investigated. Wodzicki's excision theorem is extended for inclusion crossed modules in the category of crossed modules…