Topological complexity of planar polygon spaces with small genetic code (Q516950)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Topological complexity of planar polygon spaces with small genetic code
scientific article

    Statements

    Topological complexity of planar polygon spaces with small genetic code (English)
    0 references
    0 references
    15 March 2017
    0 references
    For the definition of topological complexity of a space \(X\), \(\mathrm{TC}(X)\), see [\textit{M. Farber}, Invitation to topological robotics. Zürich: European Mathematical Society (EMS) (2008; Zbl 1148.55011)]. Given an \(n\)-tuple \(\bar l=(l_1, \dots, l_n)\) of positive real numbers, define \(M(\bar l)\) to be the equivalence classes of oriented \(n\)-gons in the plane with consecutive sides of length \(l_1, \dots, l_n\) identified under translations, rotations, and reflections. Every such space is a quotient space of a subspace of the torus \(T^n\). It is known that, for so-called generic \(n\)-tuples, the space \(M(\bar l)\) is a connected \((n-3)\)-manifold, and hence \(\mathrm{TC}(M(\bar l))\leq 2n-5\). The author determines lower bounds of the invariants \(\mathrm{TC}(M(\bar l))\) for a large family of \(n\)-tuples \(\bar l\). For example, the author presents a large list of spaces \(M(\bar l)\) with \(n\geq 5\) such that \(\mathrm{TC}(M(\bar l))\geq 2n-6\). So, in these cases, \(2n-6\leq\mathrm{TC}(M(\bar l))\leq 2n-5\).
    0 references
    configuration spaces
    0 references
    topological complexity
    0 references
    planar polygon spaces
    0 references

    Identifiers