The Orlik-Terao algebra and the cohomology of configuration space
classification
🧮 math.RT
math.ATmath.CO
keywords
givealgebracohomologyconfigurationorlik-teraorepresentationspacealgorithm
read the original abstract
We give a recursive algorithm for computing the Orlik-Terao algebra of the Coxeter arrangement of type A_{n-1} as a graded representation of S_n, and we give a conjectural description of this representation in terms of the cohomology of the configuration space of n points in SU(2) modulo translation. We also give a version of this conjecture for more general graphical arrangements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.