English
Related papers

Related papers: Graph algebras and orbit equivalence

200 papers

We show how to construct a graded locally compact Hausdorff \'etale groupoid from a C*-algebra carrying a coaction of a discrete group, together with a suitable abelian subalgebra. We call this groupoid the extended Weyl groupoid. When the…

Operator Algebras · Mathematics 2022-07-18 Toke Meier Carlsen , Efren Ruiz , Aidan Sims , Mark Tomforde

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

Combinatorics · Mathematics 2021-11-05 Jiyong Chen , Cai Heng Li , Cheryl E. Praeger , Shu-Jiao Song

In this paper, we introduce a notion of a self-similar action of a group $G$ on a $k$-graph $\Lambda$, and associate it a universal C*-algebra $\O_{G,\Lambda}$. We prove that $\O_{G,\Lambda}$ can be realized as the Cuntz-Pimsner algebra of…

Operator Algebras · Mathematics 2018-01-16 Hui Li , Dilian Yang

It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…

Combinatorics · Mathematics 2025-09-23 Kai Yuan , Yan Wang

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Combinatorics · Mathematics 2021-01-27 Jun Gao , Qingyi Huo , Chun-Hung Liu , Jie Ma

Although the concept of d-separation was originally defined for directed acyclic graphs (see Pearl 1988), there is a natural extension of he concept to directed cyclic graphs. When exactly the same set of d-separation relations hold in two…

Artificial Intelligence · Computer Science 2013-02-18 Thomas S. Richardson

We define a groupoid from a labelled space and show that it is isomorphic to the tight groupoid arising from an inverse semigroup associated with the labelled space. We then define a local homeomorphism on the tight spectrum that is a…

Operator Algebras · Mathematics 2018-12-03 Giuliano Boava , Gilles G. de Castro , Fernando de L. Mortari

We show that every subset of vertices of a directed graph E gives a Morita equivalence between a subalgebra and an ideal of the associated Leavitt path algebra. We use this observation to prove an algebraic version of a theorem of Crisp and…

Rings and Algebras · Mathematics 2017-01-13 Lisa Orloff Clark , Astrid an Huef , Pareoranga Luiten-Apirana

We study Riemannian nilmanifolds associated with graphs. We prove that such a nilmanifold is geodesic orbit if and only if it is naturally reductive if and only if its defining graph is the disjoint union of complete graphs and the…

Differential Geometry · Mathematics 2018-10-19 Y. Nikolayevsky

The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.

Rings and Algebras · Mathematics 2016-04-05 Jonathan H. Brown , Lisa Orloff Clark , Astrid an Huef

We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…

Dynamical Systems · Mathematics 2026-03-20 Eduardo Santana

The study of graph discrepancy problems, initiated by Erd\H{o}s in the 1960s, has received renewed attention in recent years. In general, given a $2$-edge-coloured graph $G$, one is interested in embedding a copy of a graph $H$ in $G$ with…

Combinatorics · Mathematics 2024-06-28 Andrea Freschi , Allan Lo

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…

Rings and Algebras · Mathematics 2019-12-12 Piotr M. Hajac , Mariusz Tobolski

We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the…

Operator Algebras · Mathematics 2013-01-11 Roberto Conti , Jeong Hee Hong , Wojciech Szymanski

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 geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…

Operator Algebras · Mathematics 2019-10-28 Sara E. Arklint , Søren Eilers , Efren Ruiz

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

For a graph $G$, let $\mathscr{C}_5(G)$ denote the graph whose vertices are the induced $5$-cycles of $G$, where two vertices are adjacent whenever the corresponding cycles share an edge. We investigate the iterative behavior of the…

Combinatorics · Mathematics 2026-04-22 Severino V. Gervacio , Hiroshi Maehara , Phoebe Chloe Ramos

A groupoid correspondence on an etale, locally compact groupoid induces a C*-correspondence on its groupoid C*-algebra. We show that the Cuntz-Pimsner algebra for this C*-correspondence relative to an ideal associated to an open invariant…

Operator Algebras · Mathematics 2026-05-20 Ralf Meyer

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Combinatorics · Mathematics 2026-04-09 Jiangdong Ai , Hui Lei , Bo Ning , Yongtang Shi