Related papers: Regular ideals of graph algebras

In this article we show that there are branching systems (which induce representations of the graph algebra $C^*(E)$) associated to each row-countable graph $E$. For row-countable graphs, we characterize the condition $(L)$ via branching…

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…

We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in…

It is now well known that a simple graph $C^*$-algebra $C^*(E)$ of a directed graph $E$ is either AF or purely infinite. In this paper, we address the question of whether this is the case for labeled graph $C^*$-algebras recently introduced…

Let $G_\omega$ be an edge-weighted simple graph. In this paper, we give a complete characterization of the graph $G_\omega$ whose edge ideal $I(G_\omega)$ is integrally closed. We also show that if $G_\omega$ is an edge-weighted star graph,…

Let E be an arbitrary graph and K be any field. For every non-graded ideal I of the Leavitt path algebra L_{K}(E), we give an explicit description of the generators of I. Using this, we show that every finitely generated ideal of L_{K}(E)…

Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subseteq J$. In this paper, we obtain a general upper and lower bound for the Castelnuovo-Mumford regularity of $IJ$ in terms of certain…

We study the gauge-invariant ideal structure of the Nica-Toeplitz algebra $\mathcal{NT}(X)$ of a product system $(A, X)$ over $\mathbb{N}^n$. We obtain a clear description of $X$-invariant ideals in $A$, that is, restrictions of…

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

Let F denote either the real or complex field. An ideal I in the free *-algebra F<x,x*> in g freely noncommuting variables and their formal adjoints is a *-ideal if I = I*. When a real *-ideal has finite codimension, it satisfies a strong…

We characterize the class of RFD $C^*$-algebras as those containing a dense subset of elements that attain their norm under a finite-dimensional representation. We show further that this subset is the whole space precisely when every…

It is known that the ideals of a Leavitt path algebra $L_K(E)$ generated by $\Pl(E)$, by $\Pc(E)$ or by $\Pec(E)$ are invariant under isomorphism. Though the ideal generated by $\Pb(E)$ is not invariant we find its \lq\lq natural\rq\rq\…

We present a classification theorem for a class of unital simple separable amenable ${\cal Z}$-stable $C^*$-algebras by the Elliott invariant. This class of simple $C^*$-algebras exhausts all possible Elliott invariant for unital stably…

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…

We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…

Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $\mathcal{D}$ contains a perfect matching consisting of leaves, we provide…

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

We investigate the question: when is a higher-rank graph C*-algebra approximately finite dimensional? We prove that the absence of an appropriate higher-rank analogue of a cycle is necessary. We show that it is not in general sufficient,…