Computations of Stable Multiplicities in the Cohomology of Configuration Space
Abstract
We describe an algorithm to compute the stable multiplicity of a family of irreducible representations in the cohomology of ordered configuration space of the plane. Using this algorithm, we compute the stable multiplicities of all families of irreducibles given by Young diagrams with 23 boxes or less up to cohomological degree 50. In particular, this determines the stable cohomology in cohomological degrees 0 ≤ i ≤ 11. We prove related qualitative results and formulate some conjectures.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.