Braid group cohomologies and algorithm complexity

DOI10.1007/BF01077624zbMath0674.68040MaRDI QIDQ1121672

Victor A. Vassiliev

Publication date: 1988

Published in: Functional Analysis and its Applications (Search for Journal in Brave)

zbMATH Keywords

cohomology groupstopological complexitylocal coefficientsalgebraic functionssuperpositionscovering projectionrepresentations of symmetric groupcohomology of braid groupsCoxeter representationsexistence of algorithmhomological genusroots of polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Covering spaces and low-dimensional topology (57M10) Braid groups; Artin groups (20F36) Cohomology of groups (20J06) Eilenberg-Mac Lane spaces (55P20) Homology of classifying spaces and characteristic classes in algebraic topology (55R40) Algorithms in computer science (68W99)

Related Items

The genus and the category of configuration spaces ⋮ Dyer-Lashof-Cohen operations in Hochschild cohomology. ⋮ Waist of the sphere for maps to manifolds ⋮ On the square peg problem and its relatives ⋮ Equivariant topological complexity ⋮ Convex equipartitions: the spicy chicken theorem ⋮ Convex equipartitions via equivariant obstruction theory ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision

Cites Work

• The mod 2 cohomology algebras of symmetric groups
• On the topology of algorithms. I
• The homology of iterated loop spaces
• Linear differential equations on a Lie group
• One-dimensional cohomologies of discrete subgroups