Related papers: Ultragraphs and shifts spaces over infinite alphab…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
We apply a method inspired by Popa's intertwining-by-bimodules technique to investigate inner conjugacy of MASAs in graph $C^*$-algebras. First we give a new proof of non-inner conjugacy of the diagonal MASA ${\mathcal D}_n$ to its…
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…
The exchange graph of a 2-acyclic quiver is the graph of mutation-equivalent quivers whose edges correspond to mutations. When the quiver admits a nondegenerate Jacobi-finite potential, the exchange graph admits a natural acyclic…
The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…
In this article we study algebraic structures of function spaces defined by graphs and state spaces equipped with Gibbs measures by associating evolution algebras. We give a constructive description of associating evolution algebras to the…
We develop a theory of type semigroups for arbitrary twisted, not necessarily Hausdorff \'etale groupoids. The type semigroup is a dynamical version of the Cuntz semigroup. We relate it to traces, ideals, pure infiniteness, and stable…
Let $G$ be a group and let $V$ be an algebraic group over an algebraically closed field. We introduce algebraic group subshifts $\Sigma \subset V^G$ which generalize both the class of algebraic sofic subshifts of $V^G$ and the class of…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
We find a substantial class of pairs of $*$-homomorphisms between graph C*-algebras of the form $C^*(E)\hookrightarrow C^*(G)\twoheadleftarrow C^*(F)$ whose pullback C*-algebra is an AF graph C*-algebra. Our result can be interpreted as a…
We show that the automorphism group of every zero entropy infinite shift admits a "drift" homomorphism to $(\mathbb{R},+)$ that maps the shift map to 1. This homomorphism arises as the expectation, under an invariant measure, of a cocycle…
There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…
Complex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a…
For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…
There are two established gradings on Leavitt path algebras associated with ultragraphs, namely the grading by the integers group and the grading by the free group on the edges. In this paper, we characterize properties of these gradings in…
We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.