Project Details
Projekt Print View

Arrangements with symmetries

Subject Area Mathematics
Term from 2015 to 2019
Project identifier Deutsche Forschungsgemeinschaft (DFG) - Project number 280581905
 
Final Report Year 2020

Final Report Abstract

This project was about arrangements of hyperplanes and had two major goals: to understand the structure of the special simplicial arrangements of hyperplanes, including classifications, and to apply the results to construct a counterexample to the longstanding conjecture of Terao. Combining group theory, computational enumerations, and traditional methods of geometry we achieved significant results for all objectives: Concerning the class of simplicial arrangements, we gave a complete classification of supersolvable simplicial arrangements, we obtained partial results on the more general (infinite) Tits arrangements, and found a computer free proof for the finiteness of the number of crystallographic arrangements in each rank. Combining the properties of simpliciality and freeness, David Geis worked on both goals simultaneously in his dissertation. His most important theorems yield, under some mild assumptions, bounds for the number of arrangements of lines for which the roots of the characteristic polynomial are only real numbers. As a corollary he obtains a new proof of the Dirac Motzkin Conjecture for this special class. Regarding Terao’s Conjecture, we proved that all ideal arrangements in Weyl arrangements are inductively free and introduced a new class of free arrangements based on the multiple addition theorem. We did not succeed in finding a counterexample. However, the new methods implemented for this search produced for example unknown (n4) configurations of lines. A very successful workshop on “Hyperplane Arrangements and Reflection Groups” which took place in Hannover in September 2019 was funded by this project.

Publications

 
 

Additional Information

Textvergrößerung und Kontrastanpassung