Proceedings of the American Mathematical Society · 2014 · 17 citations · 13 references
Natural SciencesMathematicsCombinatoricsRepresentation TheoryTopologyGroup TheoryModular FormsReflectionArrangement Of HyperplanesHyperplane ArrangementsIntersectionModular Sets
Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper A equals left-parenthesis script upper A comma upper V right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:mo>=</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:mo>,</mml:mo> <mml:mi>V</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {A} = (\mathcal {A},V)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a complex hyperplane arrangement and let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L left-parenthesis script upper A right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>L</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">L(\mathcal {A})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> denote its intersection lattice. The arrangement <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper A"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {A}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is called supersolvable, provided its lattice <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L left-parenthesis script upper A right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>L</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">L(\mathcal {A})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is supersolvable, a notion due to Stanley. Jambu and Terao showed that every supersolvable arrangement is inductively free, a notion previously due to Terao. So this is a natural subclass of this particular class of free arrangements. Suppose that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper W"> <mml:semantics> <mml:mi>W</mml:mi> <mml:annotation encoding="application/x-tex">W</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a finite, unitary reflection group acting on the complex vector space <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper V"> <mml:semantics> <mml:mi>V</mml:mi> <mml:annotation encoding="application/x-tex">V</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper A equals left-parenthesis script upper A left-parenthesis upper W right-parenthesis comma upper V right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:mo>=</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">A</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>W</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>,</mml:mo> <mml:mi>V</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {A} = (\mathcal {A}(W), V)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be the associated hyperplane arrangement of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper W"> <mml:semantics> <mml:mi>W</mml:mi> <mml:annotation encoding="application/x-tex">W</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . In a forthcoming paper by the authors, we determine all inductively free reflection arrangements. The aim of this paper is to classify all supersolvable reflection arrangements. Moreover, we characterize the irreducible arrangements in this class by the presence of modular elements of rank <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2"> <mml:semantics> <mml:mn>2</mml:mn> <mml:annotation encoding="application/x-tex">2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in their intersection lattice.
13
Finite Unitary Reflection Groups
G. C. Shephard, John A. Todd · Canadian Journal of Mathematics · 1954 · 1.1K citations · Full text
Richard P. Stanley · Algebra Universalis · 1972 · 230 citations
Invariants of Finite Reflection Groups
Louis Solomon · Nagoya Mathematical Journal · 1963 · 211 citations · Full text