Related papers: The Polynomial Endomorphisms of Graph Algebras

We describe simplicity of the Stacey crossed product A\times_\beta \N in terms of conditions of the endomorphism \beta. Then, we use a characterization of the graph C*-algebras C*(E) as the Stacey crossed product…

We study families of self-adjoint operators with given spectra whose sum is a scalar operator. Such families are $*$-representations of certain algebras which can be described in terms of graphs and positive functions on them. The main…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…

Let $K$ be any field, let $L_n$ denote the Leavitt algebra of type $(1,n-1)$ having coefficients in $K$, and let ${\rm M}_d(L_n)$ denote the ring of $d \times d$ matrices over $L_n$. In our main result, we show that ${\rm M}_d(L_n) \cong…

We continue the study of $L^p$-operator algebras associated with directed graphs initiated by Corti\~nas and Rodr\'iguez, and we establish $L^p$-analogs of both the gauge-invariant and the Cuntz-Krieger uniqueness theorems. The first of…

This mainly expository article is devoted to recent advances in the study of dynamical aspects of the Cuntz algebras O_n, with n finite, via their automorphisms and, more generally, endomorphisms. A combinatorial description of permutative…

We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…

The Weyl group of the Cuntz algebra O_n, with n finite, is investigated. This is (isomorphic to) the group of polynomial automorphisms of O_n, namely those induced by unitaries that can be written as finite sums of words in the canonical…

We consider a family of dynamical systems (A,alpha,L) in which alpha is an endomorphism of a C*-algebra A and L is a transfer operator for \alpha. We extend Exel's construction of a crossed product to cover non-unital algebras A, and show…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

We introduce a class of topologies on the Leavitt path algebra $L(\Gamma)$ of a finite directed graph and decompose a graded completion $\widehat{L}(\Gamma)$ as a direct sum of minimal ideals.

We investigate conditions on a graph $C^*$-algebra for the existence of a faithful semifinite trace. Using such a trace and the natural gauge action of the circle on the graph algebra, we construct a smooth $(1,\infty)$-summable semfinite…

Partial dynamical systems (X,alpha) arise naturally when dealing with commutative C*-dynamical system (A,delta). We associate with every pair (X,alpha), or (A,delta), a covariance C*-algebra C*(X,alpha)=C*(A,delta) which agrees with a…

We prove that a quasi-finite endomorphism of an algebraic variety over an algebraically closed field of characteristic zero, that is injective on the complement of a closed subvariety, is an automorphism. We also prove that an endomorphism…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

Motivated by recent results in graph C*-algebras concerning an equivariant pushout structure of the Vaksman-Soibelman quantum odd spheres, we introduce a class of graphs called trimmable. Then we show that the Leavitt path algebra of a…

It is known that, if removing some $n$ edges from a graph $\Gamma$ destroys all subgraphs isomorphic to a given finite graph $K$, then all subgraphs isomorphic to $K$ can be destroyed by removing at most $|E(K)|\cdot n$ edges, which form a…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…