Related papers: Flow equivalence of graph algebras
For a row-finite graph G with no sinks and in which every loop has an exit, we construct an isomorphism between Ext(C*(G)) and coker(A-I), where A is the vertex matrix of G. If c is the class in Ext(C*(G)) associated to a graph obtained by…
We pose a conjecture on the K-theory of the self-similar $k$-graph C*-algebra of a standard product of odometers. We generalize the C*-algebra $\mathcal{Q}_S$ to any subset of $\mathbb{N}^\times \setminus \{1\}$ and then realize it as the…
A tiling with infinite rotational symmetry, such as the Conway-Radin Pinwheel Tiling, gives rise to a topological dynamical system to which an \'etale equivalence relation is associated. A groupoid C*-algebra for a tiling is produced and a…
We introduce a class of subshifts under the name of "standard one-counter shifts". The standard one-counter shifts are the Markov coded systems of certain Markov codes that belong to the family of one-counter languages. We study topological…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
We prove directly that if E is a directed graph in which every cycle has an entrance, then there exists a C*-algebra which is co-universal for Toeplitz-Cuntz-Krieger E-families. In particular, our proof does not invoke ideal-structure…
We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs…
The construction of the Leavitt path algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. The new algebras, $L_K(E,C)$, are…
Let $G$ and $H$ be Hausdorff ample groupoids and let $R$ be a commutative unital ring. We show that if $G$ and $H$ are equivalent in the sense of Muhly-Renault-Williams, then the associated Steinberg algebras of locally constant $R$-valued…
We extend Nekrashevych's $KK$-duality for $C^*$-algebras of regular, recurrent, contracting self-similar group actions to regular, contracting self-similar groupoid actions on a graph, removing the recurrence condition entirely and…
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…
We give two new conditions on topological $k$-graphs that are equivalent to the Yeend's aperiodicity Condition (A). Each of the new conditions concerns finite paths rather than infinite. We use a specific example, resulting from a new…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
We propose an abstract framework of a kind of representation theory for $C^*$-flows, i.e., $C^*$-algebras equipped with one-parameter automorphism groups, as a proper generalization of Olshanski's formalism of unitary representation theory…
We study the $C^*$-algebras arising in the construction of Guionnet-Jones-Shlyakhtenko (GJS) for a planar algebra. In particular, we show they are pairwise strongly Morita equivalent, we compute their $K$-groups, and we prove many…
A new infinitesimal characterization of completely positive but not necessarily homomorphic Markov flows from a C^*-algebra to bounded operators on the boson Fock space over L^2(R) is given. Contrarily to previous characterizations, based…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…
Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…
We continue our study of the Fourier-Stieltjes algebra associated to a twisted (unital, discrete) C*-dynamical system and discuss how the various notions of equivalence of such systems are reflected at the algebra-level. As an application,…