Abstract
ABSTRACTWe give a recursive algorithm for computing the Orlik-Terao algebra of the Coxeter arrangement of type An − 1 as a graded representation of Sn, 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
