Related papers: Periodic higher rank graphs revisited

Let A be an evolution algebra (possibly infinite-dimensional) equipped with a fixed natural basis B, and let E be the associated graph defined by Elduque and Labra. We describe the group of automorphisms of A that are diagonalizable with…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

We use product systems of $C^*$-correspondences to introduce twisted $C^*$-algebras of topological higher-rank graphs. We define the notion of a continuous $\mathbb{T}$-valued $2$-cocycle on a topological higher-rank graph, and present…

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

We pursue the study of $\mathrm L^1$ full groups of graphings and of the closures of their derived groups, which we call derived $\mathrm L^1$ full groups. Our main result shows that aperiodic probability measure-preserving actions of…

In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…

Let $\pi : X\to \Lambda$ be a flat family of smooth complex projective varieties parameterized by a smooth quasi-projective variety $\Lambda$, and let $f: X\to X$ be a family of automorphisms with positive topological entropy. Suppose…

We study dimension theory for the $C^*$-algebras of row-finite $k$-graphs with no sources. We establish that strong aperiodicity - the higher-rank analogue of condition (K) - for a $k$-graph is necessary and sufficient for the associated…

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

Illusie has suggested that one should think of the classifying group of $M_X^{gp}$-torsors on a logarithmically smooth curve $X$ over a standard logarithmic point as a logarithmic analogue of the Picard group of $X$. This logarithmic Picard…

This article proposes an effective criterion for lifting automorphisms along regular coverings of graphs, with the covering transformation group being any finite abelian group.

For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose vertices are labelled by elements of $\Gamma$. We prove that a certain collection of edge sets of a $\Gamma$-labelled graph forms a delta-matroid, which we call a…

We consider a locally compact Hausdorff groupoid $G$, and twist by a more general locally compact Hausdorff abelian group $\Gamma$ rather than the complex unit circle $\mathbb{T}$. We investigate the construction of $C^*$-algebras in…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

We give a new construction of a C*-algebra from a cancellative semigroup $P$ via partial isometric representations, generalising the construction from the second named author's thesis. We then study our construction in detail for the…

Every directed graph defines a Hilbert space and a family of weighted shifts that act on the space. We identify a natural notion of periodicity for such shifts and study their C*-algebras. We prove the algebras generated by all shifts of a…

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…

When $\pi:\widetilde{\Sigma}\rightarrow D^2$ is a cover of the disc branched over $n$ marked points, the braid group $B_n$ acts on the disc by homeomorphisms fixing the marked points setwise. A braid $\beta$ \textit{lifts} if there is a…

For a large class of finite graphs $E$, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph $C^*$-algebra $C^*(E)$ such that $\alpha({\mathcal D}_E) \neq{\mathcal D}_E$, where ${\mathcal…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…