Papers
Topics
Authors
Recent
2000 character limit reached

Accurate Arrangements (2003.01435v3)

Published 3 Mar 2020 in math.GR and math.CO

Abstract: Let $\mathscr A$ be a Coxeter arrangement of rank $\ell$. In 1987 Orlik, Solomon and Terao conjectured that for every $1\leq d \leq \ell$, the first $d$ exponents of $\mathscr A$ -- when listed in increasing order -- are realized as the exponents of a free restriction of $\mathscr A$ to some intersection of reflecting hyperplanes of $\mathscr A$ of dimension $d$. This conjecture does follow from rather extensive case-by-case studies by Orlik and Terao from 1992 and 1993, where they show that all restrictions of Coxeter arrangements are free. We call a general free arrangements with this natural property involving their free restrictions accurate. In this paper we initialize their systematic study. Our principal result shows that MAT-free arrangements, a notion recently introduced by Cuntz and M\"ucksch, are accurate. This theorem in turn directly implies this special property for all ideal subarrangements of Weyl arrangements. In particular, this gives a new, simpler and uniform proof of the aforementioned conjecture of Orlik, Solomon and Terao for Weyl arrangements which is free of any case-by-case considerations. Another application of a slightly more general formulation of our main theorem shows that extended Shi arrangements, extended Catalan arrangements and ideal-Shi arrangements share this property as well. We also study arrangements that satisfy a slightly weaker condition, called almost accurate arrangements, where we simply disregard the ordering of the exponents involved. This property in turn is implied by many well established concepts of freeness such as supersolvability and divisional freeness.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.