Related papers: Examples of *-commuting maps

In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…

We generalise the theory of Cuntz-Krieger families and graph algebras to the class of finitely aligned $k$-graphs. This class contains in particular all row-finite $k$-graphs. The Cuntz-Krieger relations for non-row-finite $k$-graphs look…

We generalize the Li-Yang notion of self-similar $k$-graph $(G,\Lambda)$ and its $C^*$-algebra $\mathcal{O}_{G,\Lambda}$ to any finitely aligned $k$-graph $\Lambda$. We then introduce an inverse semigroup model for $\mathcal{O}_{G,\Lambda}$…

We propose a new model of one-dimensional traffic flow using a coupled map lattice. In the model, each vehicle is assigned a map and changes its velocity according to it. A single map is designed so as to represent the motion of a vehicle…

In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

We prove in an elementary fashion that the image of a commutative monotone $\sigma$-complete $C^*$-algebra under a $\sigma$-normal morphism is again monotone $\sigma$-complete and give an application of this result in spectral theory.

Let $R$ be a noncommutative ring with identity. The commuting graph of $R$, denoted by $\Gamma(R)$, is a graph with vertex set $R \setminus Z(R)$, and two vertices $a$, $b$ are adjacent if $a\neq b$ and $ab=ba$. Let $T=Tr(R)$ be the ring of…

We use $K^*_n$ to denote the bidirected complete graph on $n$ vertices. A nomadic Hamiltonian decomposition of $K^*_n$ is a Hamiltonian decomposition, with the additional property that ``nomads'' walk along the Hamiltonian cycles (moving…

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

We introduce the Exel-Pardo $*$-algebra $\mathrm{EP}_R(G,\Lambda)$ associated to a self-similar $k$-graph $(G,\Lambda,\varphi)$. We prove the $\mathbb{Z}^k$-graded and Cuntz-Krieger uniqueness theorems for such algebras and investigate…

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding…

Maps $f,g\colon I\to I$ are called strongly commuting if $f\circ g^{-1}=g^{-1}\circ f$. We show that strongly commuting, piecewise monotone maps $f,g$ can be decomposed into a finite number of invariant intervals (or period 2 intervals) on…

The Toeplitz algebra $\mathcal{T}C^{*}(\Lambda)$ for a finite $k$-graph $\Lambda$ is equipped with a continuous one-parameter group $\alpha^{r}$ for each $ r\in \mathbb{R}^{k}$, obtained by composing the map $\mathbb{R} \ni t \to…

We study the KMS states of the C*-algebra of a strongly connected finite k-graph. We find that there is only one 1-parameter subgroup of the gauge action that can admit a KMS state. The extreme KMS states for this preferred dynamics are…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…

Given a $k$-graph $\Lambda $ we construct a Markov space $M_\Lambda $, and a collection of $k$ pairwise commuting cellular automata on $M_\Lambda $, providing for a factorization of Markov's shift. Iterating these maps we obtain an action…

k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…