Related papers: On commutative association schemes and associated …

Let $B$ be a separable $C^*$-algebra, let $\Gamma$ be a discrete countable group, let $\alpha: \Gamma \to \text{Aut}(B)$ be an action, and let $A$ be an invariant subalgebra. We find certain freeness conditions which guarantee that any…

We define the notion of a $\Lambda$-system of $C^*$-correspondences associated to a higher-rank graph $\Lambda$. Roughly speaking, such a system assigns to each vertex of $\Lambda$ a $C^*$-algebra, and to each path in $\Lambda$ a…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…

Let $X$ be a proper algebraic scheme over an algebraically closed field. We assume that a torus $T$ acts on $X$ such that the action has isolated fixed points. The $T$-graph of $X$ can be defined using the fixed points and the one…

A graph $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], Godsil proved that any graph which is a colour class in an…

A wealth of geometric and combinatorial properties of a given linear endomorphism $X$ of $\R^N$ is captured in the study of its associated zonotope $Z(X)$, and, by duality, its associated hyperplane arrangement ${\cal H}(X)$. This…

We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…

We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple…

We give complete presentations for the dagger-compact props of affine Lagrangian and coisotropic relations over an arbitrary field. This provides a unified family of graphical languages for both affinely constrained classical mechanical…

We consider three classes of geodesic embeddings of graphs on Euclidean flat tori: (1) A toroidal graph embedding $\Gamma$ is positive equilibrium if it is possible to place positive weights on the edges, such that the weighted edge vectors…

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…

We show that a structural matrix algebra $A$ is isomorphic to the endomorphism algebra of an algebraic-combinatorial object called a generalized flag. If the flag is equipped with a group grading, an algebra grading is induced on $A$. We…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

Let $\bold G$ be a reductive algebraic group defined over $\Q$, and let $\Gamma$ be an arithmetic subgroup of $\bold G(\Q)$. Let $X$ be the symmetric space for $\bold G(\R)$, and assume $X$ is contractible. Then the cohomology (mod torsion)…

A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…

Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…

In this paper, we describe the nucleus of the Johnson graph $\Gamma = J(N,D)$ with $N > 2D$. Let $X$ denote the vertex set of $\Gamma$. Let $A \in \text{Mat}_X({\mathbb C})$ denote the adjacency matrix of $\Gamma$. Let $\{E_i\}_{i=0}^D$…

The tridiagonal algebra is defined by two generators and two relations, called the tridiagonal relations. Special cases of the tridiagonal algebra include the $q$-Onsager algebra, the positive part of the $q$-deformed enveloping algebra…