2016/03/03 by Moseley, Daniel, Proudfoot, Nicholas, Young, Ben
#14N20 #20C30 #55N33 #55R80 #Algebraic Topology (math.AT) #Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT)
paper · doi:10.48550/arxiv.1603.01189
We 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.