English
Related papers

Related papers: Williams' and Graded Equivalence Conjectures for s…

200 papers

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…

Quantum Physics · Physics 2019-05-14 Benjamin Musto , David Reutter , Dominic Verdon

We show the reduced $C^*$-algebra of a graded ample groupoid is a strongly graded $C^*$-algebra if and only if the corresponding Steinberg algebra is a strongly graded ring. We apply this result to get a theorem about the Leavitt path…

Operator Algebras · Mathematics 2020-04-21 Lisa Orloff Clark , Ellis Dawson , Iain Raeburn

We show that shift equivalence of essential adjacency matrices coincides with gauge-equivariant homotopy equivalence of their stabilized graph C*-algebras. This provide the first equivalent formulation of shift equivalence of essential…

Operator Algebras · Mathematics 2024-08-27 Boris Bilich , Adam Dor-On , Efren Ruiz

The Graded Classification Conjecture states that for finite directed graphs $E$ and $F$, the associated Leavitt path algebras $L_\K(E)$ and $L_\K(F)$ are graded Morita equivalent, i.e., $\Gr L_\K(E) \approx_{\gr} \Gr L_\K(F)$, if and only…

Representation Theory · Mathematics 2024-10-03 Wolfgang Bock , Roozbeh Hazrat , Alfilgen Sebandal

We introduce the notion of balanced strong shift equivalence between square nonnegative integer matrices, and show that two finite graphs with no sinks are one-sided eventually conjugate if and only if their adjacency matrices are conjugate…

Operator Algebras · Mathematics 2020-12-11 Kevin Aguyar Brix

In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…

Combinatorics · Mathematics 2009-05-18 Tobias Ahsendorf

We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…

Operator Algebras · Mathematics 2018-03-05 Søren Eilers , Gunnar Restorff , Efren Ruiz , Adam P. W. Sørensen

We prove that a unital shift equivalence induces a graded isomorphism of Leavitt path algebras when the shift equivalence satisfies an alignment condition. This yields another step towards confirming the Graded Classification Conjecture.…

Rings and Algebras · Mathematics 2024-09-17 Kevin Aguyar Brix , Adam Dor-On , Roozbeh Hazrat , Efren Ruiz

In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the…

Discrete Mathematics · Computer Science 2023-06-22 Laurent Beaudou , Giacomo Kahn , Matthieu Rosenfeld

We consider a variant of the notion of Morita equivalence appropriate to weak* closed algebras of Hilbert space operators, which we call {\em weak Morita equivalence}. We obtain new variants, appropriate to the dual algebra setting, of the…

Operator Algebras · Mathematics 2007-09-24 David P. Blecher , Upasana Kashyap

Given two locally compact Hausdorff groupoids $G$ and $H$ and a $(G,H)$-equivalence $Z$, one can construct the associated linking groupoid $L$. This is reminiscent of the linking algebra for Morita equivalent $C^*$-algebras. Indeed, Sims…

Operator Algebras · Mathematics 2014-12-18 Scott M. LaLonde

In this paper we show that Leavitt path algebras of weighted graphs and Leavitt path algebras of separated graphs are intimately related. We prove that any Leavitt path algebra $L(E,\omega)$ of a row-finite vertex weighted graph…

Rings and Algebras · Mathematics 2022-05-12 Pere Ara

Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…

Operator Algebras · Mathematics 2012-05-14 Adam P. W. Sørensen

Let $G = (V, E)$ be a graph and $\sigma(G)$ the number of independent (vertex) sets in $G$. Then the Merrifield-Simmons conjecture states that the sign of the term $\sigma(G_{-u}) \cdot \sigma(G_{-v}) - \sigma(G) \cdot \sigma(G_{-u-v})$…

Combinatorics · Mathematics 2013-04-26 Martin Trinks

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…

Operator Algebras · Mathematics 2015-07-09 Søren Eilers , Gunnar Restorff , Efren Ruiz , Adam P. W. Sørensen

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

Combinatorics · Mathematics 2019-06-14 Israel Rocha

A conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a…

Discrete Mathematics · Computer Science 2010-03-30 Jean-Luc Fouquet , Jean-Marie Vanherpe

We introduce a notion of $\lambda$-graph bisystem. It consists of a pair $({\frak L}^-, {\frak L}^+)$ of two labeled Bratteli diagrams ${\frak L}^-, {\frak L}^+$ over alphabets $\Sigma^-, \Sigma^+$, respectively, and satisfy certain…

Operator Algebras · Mathematics 2020-01-07 Kengo Matsumoto

These are some notes I wrote for the summer school "Symbolic dynamics and homeomorphisms of the Cantor set" at the University of Copenhagen, 23 - 27 June 2008. The notes contain the definition of the C*-algebra associated to a shift space…

Functional Analysis · Mathematics 2008-08-05 Toke Meier Carlsen

We investigate the use of labelled graphs as a Morita equivalence invariant for inverse semigroups. We construct a labelled graph from a combinatorial inverse semigroup $S$ with $0$ admitting a special set of idempotent $\mathcal{D}$-class…

Group Theory · Mathematics 2025-03-17 Zachary Duah , Stian Du Preez , David Milan , Shreyas Ramamurthy , Lucas Vega