Duality for finite bipartite graphs (with an application to II\(_ 1\) factors) (Q1314963)

From MaRDI portal
Revision as of 18:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Duality for finite bipartite graphs (with an application to II\(_ 1\) factors)
scientific article

    Statements

    Duality for finite bipartite graphs (with an application to II\(_ 1\) factors) (English)
    0 references
    0 references
    19 May 1994
    0 references
    Let \(\Gamma\) be a finite graph with bicolored vertices and \(\theta\) a color-preserving automorphism of \(\Gamma\). We define the dual graph \(\widehat\Gamma= \widehat\Gamma(\theta)\) of \(\Gamma\) by \(\theta\) and the dual \(\widehat\theta\) of \(\theta\) which is an automorphism of \(\widehat\Gamma\). Under some conditions, \(\widehat{\widehat\Gamma}\) is isomorphic to \(\Gamma\). A bicolored graph gives two weighted graphs. The following pairs of graphs treated in Index theory are dual pairs \{Coxeter graph of type \(A_{2n-3},\;D_ n\)\}, \(\{A^{(1)}_{2n-5}, D^{(1)}_ n\}, \{E^{(1)}_ 6, E^{(1)}_ 7\}\), \(\{D^{(1)}_ l, D^{(1)}_{2l-2}\}\), and \(\{4\)-\(\text{star }S(1,1,k+1,k+1), \Gamma_ k\}\). The graph of type \(D_ 4\) or \(E_ 6\) is self-dual, but as an weighted graph, the dual of it is another one. As applications, we have two kinds of outer automorphisms with the period 2 on inclusions of hyperfinite \(\text{II}_ 1\) factors, one of which gives the inclusion of the crossed products isomorphic to the original one and the other gives the inclusion not isomorphic to the original one.
    0 references
    duality
    0 references
    bipartite graphs
    0 references
    bicolored vertices
    0 references
    bicolored graph
    0 references
    weighted graphs
    0 references
    automorphisms
    0 references
    factors
    0 references

    Identifiers