Representability of trees and some of their applications (Q1810219)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Representability of trees and some of their applications
scientific article

    Statements

    Representability of trees and some of their applications (English)
    0 references
    15 June 2003
    0 references
    By definition a tree is a connected graph without cycles. The main goal of the author is a) to describe the class of trees admitting a presentation as a group and give this presentation, b) to describe trees admitting no presentation as a group as certain sets of finite sequences constructed by means of certain reccurrence relations, c) to describe periodic Gibbs measure for the Ising model on trees, d) to define and study trajectories of random walks in a random environment on an arbitrary tree.
    0 references
    connected graph
    0 references
    periodic Gibbs measure
    0 references
    Ising model
    0 references
    random walks
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references