中文
相关论文

相关论文: Removing sources from higher-rank graphs

200 篇论文

We show that if a graph admits a packing and a covering both consisting of $\lambda$ many spanning trees, where $\lambda$ is some infinite cardinal, then the graph also admits a decomposition into $\lambda$ many spanning trees. For finite…

组合数学 · 数学 2024-05-27 Joshua Erde , Pascal Gollin , Atilla Joó , Paul Knappe , Max Pitz

In this note we extend the spectral theorem for bimodules to the higher rank graph C*-algebra context. Under the assumption that the graph is row finite and has no sources, we show that a bimodule over a natural abelian subalgebra is…

算子代数 · 数学 2007-05-23 Alan Hopenwasser

We study the relational graph models that constitute a natural subclass of relational models of lambda-calculus. We prove that among the lambda-theories induced by such models there exists a minimal one, and that the corresponding…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Flavien Breuvart , Giulio Manzonetto , Domenico Ruoppolo

We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph $\Lambda$ we consider has an associated $C^*$-algebra, denoted $C^*(\Lambda)$, which is simple and purely…

算子代数 · 数学 2010-02-01 Peter Lewin , David Pask

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…

算子代数 · 数学 2022-02-18 Tim Schenkel

We introduce a method to define $C^*$-algebras from $C^*$-correspondences. Our construction generalizes Cuntz-Pimsner algebras, crossed products by Hilbert $C^*$-modules, and graph algebras.

算子代数 · 数学 2007-05-23 Takeshi Katsura

This is the final one in the series of papers where we introduce and study the $C^*$-algebras associated with topological graphs. In this paper, we get a sufficient condition on topological graphs so that the associated $C^*$-algebras are…

算子代数 · 数学 2007-05-23 Takeshi Katsura

We study Sims-Yeend's product system C*-algebras and topological higher-rank graph C*-algebras by Yeend. We give a relation between Katsura's Cuntz-Pimsner covariance and Sims-Yeend's one by a direct approach and an explicit form of the…

算子代数 · 数学 2010-10-15 Shinji Yamashita

We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…

环与代数 · 数学 2021-09-20 Søren Eilers , Gunnar Restorff , Efren Ruiz , Adam P. W. Sørensen

We study groupoids and semigroup C*-algebras arising from graphs of monoids, in the setting of right LCM monoids. First, we establish a general criterion when a graph of monoids gives rise to a submonoid of the fundamental group which is…

算子代数 · 数学 2022-12-06 Cheng Chen , Xin Li

We show that if $A$ is a unital $C^*$-algebra and $B$ is a Cuntz-Krieger algebra for which $A\otimes\mathbb{K} \cong B\otimes\mathbb{K}$, then $A$ is a Cuntz-Krieger algebra. Consequently, corners of Cuntz-Krieger algebras are Cuntz-Krieger…

算子代数 · 数学 2013-09-20 Sara E. Arklint , Efren Ruiz

We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…

算子代数 · 数学 2011-10-10 Alex Kumjian , David Pask , Aidan Sims

We generalize the classification result of Restorff on Cuntz-Krieger algebras to cover all unital graph C*-algebras with real rank zero, showing that Morita equivalence in this case is determined by ordered, filtered K-theory as conjectured…

算子代数 · 数学 2015-07-09 Søren Eilers , Gunnar Restorff , Efren Ruiz , Adam P. W. Sørensen

We consider conditions on a $k$-graph $\Lambda$, a semigroup $S$ and a functor $\eta : \Lambda \to S$ which ensure that the $C^*$-algebra of the skew-product graph $\Lambda \times_\eta S$ is simple. Our results allow give some necessary and…

算子代数 · 数学 2013-06-27 Ben Maloney , David Pask

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

环与代数 · 数学 2019-12-12 Piotr M. Hajac , Mariusz Tobolski

We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…

逻辑 · 数学 2008-02-03 Eric C. Milner , Saharon Shelah

It is proved that the C*-algebra of a graph is residually finite dimensional (RFD) if and only if the graph has no infinite receiver, no cycle with an exit, no infinite ackward chain and from each vertex, there is a finite path to a sink or…

算子代数 · 数学 2026-04-09 Guillaume Bellier

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

表示论 · 数学 2024-11-04 Karin M. Jacobsen , Mads Hustad Sandøy , Laertis Vaso

We give a construction of Kirchberg algebras from graphs. By using product graphs in the construction we are able to provide models for general (UCT) Kirchberg algebras while maintaining the explicit generators and relations of the…

算子代数 · 数学 2007-05-23 Jack Spielberg

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…

组合数学 · 数学 2025-12-29 David Pask