On the complexity of sails. Appendix by Frederick Manners.

From MaRDI portal
Publication:450504

DOI10.2140/PJM.2012.258.1zbMATH Open1282.20044arXiv1102.1365OpenAlexW2082698914MaRDI QIDQ450504FDOQ450504


Authors: Lukas Brantner Edit this on Wikidata


Publication date: 13 September 2012

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Abstract: This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to an associated subset-sum type problem. Combining both estimates, we prove that, as n tends to infinity, words of reduced length n generically have scl arbitrarily close to n/4 - 1. We then show that, unless P=NP, there is no polynomial time algorithm to compute scl of efficiently encoded words in F2. All these results are obtained by exploiting the fundamental connection between scl and the geometry of certain rational polyhedra. Their extremal rays have been classified concisely and completely. However, we prove that a similar classification for extremal points is impossible in a very strong sense.


Full work available at URL: https://arxiv.org/abs/1102.1365




Recommendations





Cited In (5)





This page was built for publication: On the complexity of sails. Appendix by Frederick Manners.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450504)