Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Forum Mathematicum

Managing Editor: Bruinier, Jan Hendrik

Ed. by Blomer, Valentin / Cohen, Frederick R. / Droste, Manfred / Duzaar, Frank / Echterhoff, Siegfried / Frahm, Jan / Gordina, Maria / Shahidi, Freydoon / Sogge, Christopher D. / Takayama, Shigeharu / Wienhard, Anna

IMPACT FACTOR 2018: 0.867

CiteScore 2018: 0.71

SCImago Journal Rank (SJR) 2018: 0.898
Source Normalized Impact per Paper (SNIP) 2018: 0.964

Mathematical Citation Quotient (MCQ) 2018: 0.71

See all formats and pricing
More options …
Volume 29, Issue 2


Topological complexity of planar polygon spaces with small genetic code

Donald M. Davis
Published Online: 2016-06-04 | DOI: https://doi.org/10.1515/forum-2016-0018


We determine lower bounds for the topological complexity of many planar polygon spaces mod isometry. With very few exceptions, the upper and lower bounds given by dimension and cohomology considerations differ by 1. This is true for 130 of the 134 generic 7-gon spaces. Our results apply to spaces of n-gons for all n, but primarily for those whose genetic codes, in the sense of Hausmann and Rodriguez, are moderately small.

Keywords: Topological complexity; planar polygon spaces

MSC 2010: 55M30; 58D29; 55R80


About the article

Received: 2015-12-29

Revised: 2016-01-23

Published Online: 2016-06-04

Published in Print: 2017-03-01

Citation Information: Forum Mathematicum, Volume 29, Issue 2, Pages 313–328, ISSN (Online) 1435-5337, ISSN (Print) 0933-7741, DOI: https://doi.org/10.1515/forum-2016-0018.

Export Citation

© 2017 by De Gruyter.Get Permission

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

Donald M. Davis
Topology and its Applications, 2018, Volume 250, Page 27

Comments (0)

Please log in or register to comment.
Log in