Related papers: Visualizing automorphisms of graph algebras
A $C^*$-textile dynamical system $({\cal A}, \rho,\eta,\Sigma^\rho,\Sigma^\eta, \kappa)$ connsists of a unital $C^*$-algebra ${\cal A}$, two families of endomorphisms ${\rho_\alpha}_{\alpha \in \Sigma^\rho}$ and ${\eta_a}_{a \in…
Motivated by Exel's inverse semigroup approach to combinatorial C*-algebras, in a previous work the authors defined an inverse semigroup associated with a labelled space. We construct a representation of the C*-algebra of a labelled space,…
An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
The approach we present is a modification of the Morse theory for unital C*-algebras. We provide tools for the geometric interpretation of noncommutative CW complexes. These objects were introduced and studied in [2],[7] and [14]. Some…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…
We classify the gauge-invariant ideals in the C*-algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gauge-invariant primitive ideals in terms of the structural…
It is shown how nonlinear versions of quantum mechanics can be refolmulated in terms of a (linear) C*-algebraic theory. Then also their symmetries are described as automorphisms of the correspondong C*-algebra. The requirement of…
This article deals with homomorphisms of oriented graphs with respect to push equivalence. Here homomorphisms refer to arc preserving vertex mappings, and push equivalence refers to the equivalence class of orientations of a graph $G$ those…
Given a semigroup of local homeomorphisms on a compact space X we consider the corresponding semigroup of *-endomorphisms on C(X) and discuss the possibility of extending it to an interaction group, a concept recently introduced by the…
Starting from an arbitrary endomorphism $\alpha$ of a unital C*-algebra $A$ we construct a bigger C*-algebra $B$ and extend $\alpha$ onto $B$ in such a way that the extended endomorphism $\alpha$ has a unital kernel and a hereditary range,…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…
Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…
We describe both the Bunce-Deddens C*-algebras and their Toeplitz versions, as crossed products of commutative C*-algebras by partial automorphisms. In the latter case, the commutative algebra has, as its spectrum, the union of the Cantor…