Related papers: A Normal Graph Algebra
Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph…
Let $\Sigma$ be a surface with negative Euler characteristic, genus at least one and at most one boundary component. We prove that the skein algebra of $\Sigma$ over the field of rational functions can be algebraically generated by a finite…
Albert algebras, a specific kind of Jordan algebra, are naturally distinguished objects among commutative non-associative algebras and also arise naturally in the context of simple affine group schemes of type $F_4$, $E_6$, or $E_7$. We…
The main goal of this note is to show that subalgebras of regular evolution algebras are themselves evolution algebras. This allows us to assume, without loss of generality, that every subalgebra in the regular setting has a basis…
Given a set of matrices, it is often of interest to determine the algebra they generate. Here we exploit the concept of the Burnside graph of a set of matrices, and show how it may be used to deduce properties of the algebra they generate.…
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…
We define graded Hopf algebras with bases labeled by various types of graphs and hypergraphs, provided with natural embeddings into an algebra of polynomials in infinitely many variables. These algebras are graded by the number of edges and…
We give a construction of Kirchberg algebras from graphs. By using product graphs in the construction we are able to provide models for general (UCT) Kirchberg algebras while maintaining the explicit generators and relations of the…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We will introduce a notion of normal subshifts. A subshift $(\Lambda,\sigma)$ is said to be normal if it satisfies a certain synchronizing property called $\lambda$-synchronizing and is infinite as a set. We have lots of purely infinite…
In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
For a finite connected simple graph, the Terwilliger algebra is a matrix algebra generated by the adjacency matrix and idempotents corresponding to the distance partition with respect to a fixed vertex. We will consider algebras defined by…
Graphs are fundamental data structures which concisely capture the relational structure in many important real-world domains, such as knowledge graphs, physical and social interactions, language, and chemistry. Here we introduce a powerful…
In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…
Given an evolution algebra associated to a connected finite graph $\Gamma$, we exhibit a free action of the group of symmetries of $\Gamma$ on the set of automorphisms of the algebra. This allows us to explicitly describe this set and we…
For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…
A graph is normal if it admits a clique cover $\mathcal C$ and a stable set cover $\mathcal S$ such that each clique in $\mathcal C$ and each stable set in $\mathcal S$ have a vertex in common. The pair $(\mathcal{C,S})$ is a normal cover…