中文
相关论文

相关论文: Computing Ext for graph algebras

200 篇论文

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$…

组合数学 · 数学 2007-05-23 Guizhen Liu , Qinglin Yu

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

In a number of recent papers, (k+l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C*-algebraic considerations, so they have not been treated…

算子代数 · 数学 2010-06-10 Alex Kumjian , David Pask , Aidan Sims

The equator of a graph is the length of a longest isometric cycle. We bound the order $n$ of a graph from below by its equator $q$, girth $g$ and minimum degree $\delta$ - and show that this bound is sharp when there exists a Moore graph…

组合数学 · 数学 2024-07-16 Brandon Du Preez

For any countable graph $E$, we investigate the relationship between the Leavitt path algebra $L_{\C}(E)$ and the graph C*-algebra $C^*(E)$. For graphs $E$ and $F$, we examine ring homomorphisms, ring *-homomorphisms, algebra homomorphisms,…

算子代数 · 数学 2009-12-08 Gene Abrams , Mark Tomforde

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

组合数学 · 数学 2022-12-06 Jie Ma , Tianchi Yang

We give entropy estimates for two canonical non commutative shifts on $C^*$-algebras associated to some topological graphs $E=(E^0,E^1,s,r)$, defined using a basis of the corresponding Hilbert bimodule $H(E)$. We compare their entropies…

算子代数 · 数学 2009-01-05 Valentin Deaconu

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

群论 · 数学 2013-01-21 Mathieu Carette

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective…

组合数学 · 数学 2012-10-18 Jan Hubicka , Jürgen Jost , Yangjing Long , Peter F. Stadler , Ling Yang

We prove that an isomorphism of graded Grothendieck groups $K^{gr}_0$ of two Leavitt path algebras induces an isomorphism of a certain quotient of algebraic filtered $K$-theory and consequently an isomorphism of filtered $K$-theory of their…

环与代数 · 数学 2020-05-18 Pere Ara , Roozbeh Hazrat , Huanhuan Li

Given a graph G, of arbitrary size and unbounded vertex degree, denote by |G| the one-complex associated with $G$. The topological space |G| is n-arc connected (n-ac) if every set of no more than n points of |G| are contained in an arc (a…

组合数学 · 数学 2018-06-01 Paul Gartside , Ana Mamatelashvili , Max Pitz

There is a Rota-Baxter algebra structure on the field $A=\mathbf{k}((t))$ with $ P$ being the projection map $A=\mathbf{k}[[t]]\oplus t^{-1}\mathbf{k}[t^{-1}]$ onto $ \mathbf{k}[[ t]]$. We study the representation theory and…

表示论 · 数学 2016-03-21 Zongzhu Lin , Li Qiao

We show that the method to construct C^*-algebras from topological graphs, introduced in our previous paper, generalizes many known constructions. We give many ways to make new topological graphs from old ones, and study the relation of…

算子代数 · 数学 2007-05-23 Takeshi Katsura

For a graph $G$ with $p$ vertices the closed convex cone $\mathbb{S}^p_{\succeq0}(G)$ consists of all real positive semidefinite $p\times p$ matrices with zeros in the off-diagonal entries corresponding to nonedges of $G$. The extremal rays…

组合数学 · 数学 2015-09-22 Liam Solus , Caroline Uhler , Ruriko Yoshida

Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create…

组合数学 · 数学 2018-08-13 Supriyo Dutta , Bibhas Adhikari

We show that the endomorphism ring of any nonzero finitely generated projective module over the Leavitt path algebra $L_K(E)$ of an arbitrary graph $E$ with coefficients in a field $K$ is isomorphic to a Steinberg algebra. This yields in…

环与代数 · 数学 2019-09-10 Gene Abrams , Mikhailo Dokuchaev , T. G. Nam

We define the completion of an associative algebra $A$ in a set $M=\{M_1,\dots,M_r\}$ of $r$ right $A$-modules in such a way that if $\mathfrak a\subseteq A$ is an ideal in a commutative ring $A$ the completion $A$ in the (right) module…

代数几何 · 数学 2024-10-23 Arvid Siqveland

We generalize a recent construction of Exel and Pardo, from discrete groups acting on finite directed graphs to locally compact groups acting on topological graphs. To each cocycle for such an action, we construct a $C^*$-correspondence…

算子代数 · 数学 2017-11-02 Erik Bédos , S. Kaliszewski , John Quigg

In this paper, we introduce a C*-algebra associated to any substitution (via its Bratteli diagram model). We show that this C*-algebra contains the partial crossed product C*-algebra of the corresponding Bratteli-Vershik system and show…

算子代数 · 数学 2011-08-24 Daniel Gonçalves , Danilo Royer

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

量子代数 · 数学 2009-11-11 Israel Gelfand , Sergei Gelfand , Vladimir Retakh , Robert Lee Wilson
‹ 上一页 1 8 9 10 下一页 ›