Algorithms for finding connected separators between antipodal points (Q2463880)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithms for finding connected separators between antipodal points
scientific article

    Statements

    Algorithms for finding connected separators between antipodal points (English)
    0 references
    0 references
    0 references
    0 references
    6 December 2007
    0 references
    The authors study a concept of a symmetric separator of a symmetric (with respect to the action of \(\mathbb{Z}_2\) given by the antipodal map or an involution) subset in \(\mathbb{R}^n\). They show the relation of symmetric separators with the Borsuk-Ulam antipodal theorem and provide some algorithms for the construction of connected symmetric separators of the cube, the sphere in \(\mathbb{R}^n\) and, in general, for a symmetric unicoherent polyhedron, by choosing an appropriate subcollection of its triangulation.
    0 references
    symmetric separator
    0 references
    odd function
    0 references
    antipodal map
    0 references
    involution
    0 references
    polyhedron
    0 references
    topological algorithm
    0 references

    Identifiers

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