English
Related papers

Related papers: Reconstructing directed graphs from generalised ga…

200 papers

Let $E$ be a countable directed graph that is amplified in the sense that whenever there is an edge from $v$ to $w$, there are infinitely many edges from $v$ to $w$. We show that $E$ can be recovered from $C^*(E)$ together with its…

Operator Algebras · Mathematics 2020-07-03 Søren Eilers , Efren Ruiz , Aidan Sims

We prove directly that if E is a directed graph in which every cycle has an entrance, then there exists a C*-algebra which is co-universal for Toeplitz-Cuntz-Krieger E-families. In particular, our proof does not invoke ideal-structure…

Operator Algebras · Mathematics 2010-01-13 Aidan Sims , Samuel B. G. Webster

The graph C*-algebra of a directed graph E is the universal C*-algebra generated by a family of partial isometries satisfying relations which reflect the path structure of E. In the first part of this paper we consider coverings of directed…

Operator Algebras · Mathematics 2007-05-23 Klaus Deicke , David Pask , Iain Raeburn

We develop notions of a representation of a topological graph E and of a covariant representation of a topological graph E which do not require the machinery of C*-correspondences and Cuntz-Pimsner algebras. We show that the C*-algebra…

Operator Algebras · Mathematics 2012-05-16 Hui Li , David Pask , Aidan Sims

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

Combinatorics · Mathematics 2008-06-11 Vladimir Retakh , Robert Lee Wilson

Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries of shapes and utilized to compute distances. In this…

Computational Geometry · Computer Science 2018-11-29 Brittany Terese Fasy , Samuel Micka , David L. Millman , Anna Schenfisch , Lucia Williams

For a directed graph $E$, we compute the $K$-theory of the $C^*$-algebra $C^*(E)$ from the Cuntz-Krieger generators and relations. First we compute the $K$-theory of the crossed product $C^*(E)\times_\gamma\IT$, and then using duality and…

Operator Algebras · Mathematics 2009-06-23 Menassie Ephrem , Jack Spielberg

There has recently been much interest in the $C^*$-algebras of directed graphs. Here we consider product systems $E$ of directed graphs over semigroups and associated $C^*$-algebras $C^*(E)$ and $\mathcal{T}C^*(E)$ which generalise the…

Operator Algebras · Mathematics 2016-09-07 Iain Raeburn , Aidan Sims

We show that the C*-algebra of a regular 2-step nilpotent lie group can be recovered using continuous fields of Toeplitz algebras and a crossed product. We generalize this result to polycontact manifolds in the sense of van Erp which are…

Operator Algebras · Mathematics 2025-12-19 Clément Cren

A graph is $\ell$-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $\ell$ vertices. We prove that strongly regular graphs with at least six vertices are $2$-reconstructible.

Combinatorics · Mathematics 2022-10-24 Douglas B. West , Xuding Zhu

We introduce the notion of \pi-extension of the semigroup \mathbb{Z}_+ and study the extensions of the Toeplitz algebras by isometric operators. We show that when the action of the Toeplitz algebra is irreducible all such extensions…

Operator Algebras · Mathematics 2013-02-05 T. A. Grigoryan , E. V. Lipacheva , V. H. Tepoyan

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

Combinatorics · Mathematics 2015-07-22 Élie de Panafieu , Lander Ramos

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…

Group Theory · Mathematics 2016-05-26 Z. Mesyan , J. D. Mitchell , M. Morayne , Y. H. Péresse

We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.

Computational Geometry · Computer Science 2019-12-09 Brittany Terese Fasy , Rafal Komendarczyk , Sushovan Majhi , Carola Wenk

Given a directed graph E, we construct for each real number l a quiver whose vertex space is the topological realisation of E, and whose edges are directed paths of length l in the vertex space. These quivers are not topological graphs in…

Operator Algebras · Mathematics 2018-07-24 Aidan Sims

In this paper, we study the exact learning problem for weighted graphs, where we are given the vertex set, $V$, of a weighted graph, $G=(V,E,w)$, but we are not given $E$. The problem, which is also known as graph reconstruction, is to…

Data Structures and Algorithms · Computer Science 2025-11-20 Michael T. Goodrich , Songyu Liu , Ioannis Panageas

An approach to the construction of index formulas for elliptic operators on singular manifolds is suggested on the basis of K-theory of algebras and cyclic cohomology. The equivalence of Toeplitz and pseudodifferential quantizations, well…

Analysis of PDEs · Mathematics 2011-11-08 V. Nazaikinskii , G. Rozenblum , A. Savin , B. Sternin

It is known that given a directed graph E and a subset X of vertices, the sum of the projections associated to the vertices in X in the C*-algebra of E converges strictly in the multiplier algebra to a projection P. Here we give a…

Operator Algebras · Mathematics 2013-01-04 Tyrone Crisp

Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$…

Metric Geometry · Mathematics 2024-06-27 Robert Connelly , Steven J. Gortler , Louis Theran

We present a construction of 2-step nilpotent Lie algebras using labeled directed simple graphs, which allows us to give a criterion to detect certain ideals and subalgebras by finding special subgraphs. We prove that if a label occurs only…

Differential Geometry · Mathematics 2023-08-08 Mauricio Godoy Molina , Diego Lagos
‹ Prev 1 2 3 10 Next ›