Mathematicians Crack Harder Problem in Geometry, Extending Decades-Old Theory
Researchers have solved a more complex version of a mathematical problem about the shapes of curves, pushing forward a 30-year-old theoretical framework. The advance could eventually help industries relying on geometric computation—from graphics design to cryptography—better understand and optimize their systems.
Originaltitel: Weight 11 Compactly Supported Cohomology Of Moduli Spaces Of Curves In Excess Four
<p>In a recent article, Sam Payne and Thomas Willwacher construct a combinatorial graph complex to compute the weight 11 part of the compactly supported cohomology of the moduli space of curves Mg,n and compute explicitly the cohomology of the introduced graph complexes in cases of complexes of excess zero, one, two, and three. In this paper, we extend the computation of the cohomology to excess four graph complexes. Additionally, we provide further details on the generators, the computation process, and the definition of the graph complex.</p>