English
Related papers

Related papers: Periodic higher rank graphs revisited

200 papers

Let $\Lambda$ be a row-finite and source-free higher rank graph with finitely many vertices. In this paper, we define the Higman-Thompson like group $\Lht$ of the graph C*-algebra $\mathcal{O}_\Lambda$ to be a special subgroup of the…

Operator Algebras · Mathematics 2021-05-19 Dilian Yang

We introduce the notion of orbit equivalence of directed graphs, following Matsumoto's notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if…

Operator Algebras · Mathematics 2017-05-23 Nathan Brownlowe , Toke Meier Carlsen , Michael F. Whittaker

The notion of a generalized scale emerged in recent joint work with Afsar-Brownlowe-Larsen on equilibrium states on C*-algebras of right LCM monoids, where it features as the key datum for the dynamics under investigation. This work…

Group Theory · Mathematics 2019-03-25 Nicolai Stammeier

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…

Operator Algebras · Mathematics 2020-01-16 Johannes Christensen

Let $\Gamma$ be a connected regular graph with an eigenvalue $\lambda$ and corresponding idempotent $E_{\lambda}$. Let ${\cal E}_{\lambda}=\langle J,E_{\lambda}\rangle^\circ$ be the algebra generated by $J$ and $E_\lambda$ with respect to…

Combinatorics · Mathematics 2026-03-25 Edwin R. van Dam , Giusy Monzillo , Safet Penjić

To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…

Operator Algebras · Mathematics 2007-05-23 Stephen C Power

We analyse extensions $\Sigma$ of groupoids $G$ by bundles $A$ of abelian groups. We describe a pushout construction for such extensions, and use it to describe the extension group of a given groupoid $G$ by a given bundle $A$. There is a…

Operator Algebras · Mathematics 2021-07-14 Marius Ionescu , Alex Kumjian , Jean N. Renault , Aidan Sims , Dana P. Williams

We prove that the graph C*-algebra $C^*(E)$ of a trimmable graph $E$ is $U(1)$-equivariantly isomorphic to a pullback C*-algebra of a subgraph C*-algebra $C^*(E'')$ and the C*-algebra of functions on a circle tensored with another subgraph…

K-Theory and Homology · Mathematics 2018-09-10 Francesca Arici , Francesco D'Andrea , Piotr M. Hajac , Mariusz Tobolski

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

Combinatorics · Mathematics 2016-11-22 Ricky Rotheram , Sanming Zhou

Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…

Logic in Computer Science · Computer Science 2023-03-03 Thierry Boy de la Tour

B. Blackadar recently proved that any full corner $pAp$ in a unital C*-algebra $A$ has K-theoretic stable rank greater than or equal to the stable rank of $A$. (Here $p$ is a projection in $A$, and fullness means that $ApA=A$.) This result…

Rings and Algebras · Mathematics 2007-05-23 P. Ara , K. R. Goodearl

We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between 'lambda-higher-order term graphs' (lambda-ho-term-graphs), which are first-order term graphs endowed…

Logic in Computer Science · Computer Science 2013-02-27 Clemens Grabmayer , Jan Rochel

We prove that if \Lambda is a row-finite k-graph with no sources, then the associated C^*-algebra is simple if and only if \Lambda is cofinal and satisfies Kumjian and Pask's Condition (A). We prove that Condition (A) is equivalent to a…

Operator Algebras · Mathematics 2007-12-12 David I. Robertson , Aidan Sims

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

Probability · Mathematics 2023-03-02 Raimundo Briceño

We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…

Combinatorics · Mathematics 2025-12-29 David Pask

The graph G(p) associated with the p-groups of maximal class is a major tool in their classification. We introduce a subgraph of the graph G(p) called its frame. Its construction is based on the Lazard correspondence. We show that every…

Group Theory · Mathematics 2025-12-15 Bettina Eick , Patali Komma , Subhrajyoti Saha

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…

Combinatorics · Mathematics 2013-05-01 Ye Luo

Let $A$ be a unital locally matrix algebra. Among the examples of such algebras are: (1) an infinite tensor product $\otimes M_{n_i}(\mathbb{F})$ of matrix algebras over a field $\mathbb{F}$, and (2) the Clifford algebra of a nondegenerate…

Rings and Algebras · Mathematics 2026-01-13 Oksana Bezushchak

For two derived equivalent $k$-algebras $\bar\Lambda$ and $\bar\Gamma$, we introduce a correspondence between $\OO$-orders reducing to $\bar\Lambda$ and $\OO$-orders reducing to $\bar\Gamma$. We outline how this may be used to transfer…

Representation Theory · Mathematics 2012-02-13 Florian Eisele

We construct a new family of linearizations of rational matrices $R(\lambda)$ written in the general form $R(\lambda)= D(\lambda)+C(\lambda)A(\lambda)^{-1}B(\lambda)$, where $D(\lambda)$, $C(\lambda)$, $B(\lambda)$ and $A(\lambda)$ are…

Numerical Analysis · Mathematics 2020-03-09 Javier Pérez , María C. Quintana
‹ Prev 1 3 4 5 6 7 10 Next ›