scholarly journals Viewing AF-algebras as graph algebras

1999 ◽  
Vol 128 (7) ◽  
pp. 1991-2000 ◽  
Author(s):  
D. Drinen
Keyword(s):  
As Graph ◽  
2009 ◽  
Vol 257 (5) ◽  
pp. 1589-1620 ◽  
Author(s):  
Takeshi Katsura ◽  
Aidan Sims ◽  
Mark Tomforde
Keyword(s):  
As Graph ◽  

1989 ◽  
Vol 39 (2) ◽  
pp. 265-276
Author(s):  
R. Pöschel

In this paper varieties are investigated which are generated by graph algebras of undirected graphs and—in most cases—contain Murskii's groupoid (that is the graph algebra of the graph with two adjacent vertices and one loop). Though these varieties are inherently nonfinitely based, they can be finitely based as graph varieties (finitely graph based) like, for example, the varitey generated by Murskii's groupoid. Many examples of nonfinitely based graph varities containing Murskii's groupoid are given, too. Moreover, the coatoms in the subvariety lattice of the graph variety of all undirected graphs are described. There are two coatoms and they are finitely graph based.


1994 ◽  
Vol 05 (03) ◽  
pp. 291-327 ◽  
Author(s):  
DAVID E. EVANS ◽  
JEREMY D. GOULD

If Γ is a graph, with distinguished vertex *, let A(Γ) denote the non-commutative path algebra on the space [Formula: see text] of semi-infinite paths in Γ beginning at *. We discuss embeddings A(Γ1) → A(Γ2) of AF algebras associated with graphs Γ1 and Γ2 from a dimension group point of view. For certain infinite T-shaped graphs, we have K0(A(Γ)) ≅ ℤ [t], with positive cone identified with {0}∪ {P ∈ ℤ [t]: P (λ) > 0, λ ∈ (0, γ]}, where γ = γ (Γ) =||Γ||−2 < 1/4. Hence for certain graphs there exists a unital homomorphism A(Γ1) → A(Γ2) if ||Γ1|| ≤ ||Γ2||. For certain finite T-shaped graphs K0 (A(Γ)) ≅ ℤ [t]/<Q> where <Q> denotes the ideal generated by a polynomial Q=Q(Γ) which is essentially the characteristic polynomial of the graph Γ and positive cone identified with {0}∪ {f + <Q>: f(γ) > 0} where γ = γ(Γ) = ||Γ||-2. Hence there exists a unital homomorphism A(Γ1) → A(Γ2) if ||Γ1|| = ||Γ2||, and Q(Γ2) divides Q(Γ1). The structure of K0(A(Γ)) as an ordered ring is related to the fusion rules of rational conformal field theory.


Author(s):  
Marialena Kyriakidi ◽  
Georgia Koutrika ◽  
Yannis Ioannidis
Keyword(s):  

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1825
Author(s):  
Viliam Ďuriš ◽  
Gabriela Pavlovičová ◽  
Dalibor Gonda ◽  
Anna Tirpáková

The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific disciplines such as graph theory and complexity theory. It is important in solving many practical tasks that require the compilation of an object with certain properties, proves the existence or non-existence of some properties, or specifies the number of objects of certain properties. This paper examines the basic combinatorial structures and presents their use and learning using relations through the Placemat method in teaching process. The effectiveness of the presented innovative way of teaching combinatorics was also verified experimentally at a selected high school in the Slovak Republic. Our experiment has confirmed that teaching combinatorics through relationships among talented children in mathematics is more effective than teaching by a standard algorithmic approach.


1949 ◽  
Vol 48 (1) ◽  
pp. 38-40
Author(s):  
Adelaide Blouch
Keyword(s):  

Author(s):  
Erkko Lehtonen ◽  
Tamás Waldhauser

AbstractAssociative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities: constant 1, powers of 2, and Catalan numbers. Associative and antiassociative digraphs are described, and associative spectra are determined for certain families of digraphs, such as paths, cycles, and graphs on two vertices.


2021 ◽  
pp. 105-113
Author(s):  
N. D. Moskin ◽  

The work is devoted to methods for comparing and classifying graphs. This trend is known as "graph matching". An overview of metrics for comparing graphs based on the maximum common subgraph is given. A modification of the distance based on the maximum common subgraph, which takes into account the ordering of the vertices, is proposed. It is shown that this function satisfies all the properties of the metric (non-negativity, identity, symmetry, triangle inequality).


Sign in / Sign up

Export Citation Format

Share Document