On inductively free restrictions of reflection arrangements.

DOI10.1016/J.JALGEBRA.2014.06.036MaRDI QIDQ406361zbMATHOpenAlexFDO

Authors Nils Amend, Torsten Hoge, Gerhard Röhrle

Publication date 8 September 2014

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.1708

zbMATH Keywords

complex reflection groupshyperplane arrangementsinductively free arrangementsrestricted arrangements

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Configurations and arrangements of linear subspaces (14N20)

Abstract: Let W be a finite complex reflection group acting on the complex vector space V and let A(W) = (A(W), V) be the associated reflection arrangement. In an earlier paper by the last two authros, we classified all inductively free reflection arrangements A(W). The aim of this note is to extend this work by determining all inductively free restrictions of reflection arrangements.

Recommendations

• On inductively free reflection arrangements.
• Inductive freeness of Ziegler's canonical multiderivations for reflection arrangements
• Divisionally free restrictions of reflection arrangements
• Recursively free reflection arrangements
• Freeness and multirestriction of hyperplane arrangements
• Freeness of multi-reflection arrangements via primitive vector fields
• Inductive and recursive freeness of localizations of multiarrangements
• Restrictions of free arrangements and the division theorem
• Freeness of hyperplane arrangements and related topics
• Some remarks on free arrangements

Cites work

• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• scientific article; zbMATH DE number 3803606 (Why is no real title available?)
• scientific article; zbMATH DE number 3297198 (Why is no real title available?)
• Arrangements defined by unitary reflection groups
• CHEVIE -- A system for computing and processing generic character tables
• Differential Equations Invariant Under Finite Reflection Groups
• Finite Unitary Reflection Groups
• Free arrangements of hyperplanes and supersolvable lattices
• Free but not recursively free arrangements
• On inductively free restrictions of reflection arrangements.
• Reflection arrangements are hereditarily free
• SINGULAR

Cited in

(17)

• Some remarks on free arrangements
• Addition-deletion theorems for factorizations of Orlik-Solomon algebras and nice arrangements
• On \(A_1^2\) restrictions of Weyl arrangements
• On inductively free restrictions of reflection arrangements.
• Nice reflection arrangements.
• Divisionally free arrangements of hyperplanes
• Inductive and recursive freeness of localizations of multiarrangements
• Inductive freeness of Ziegler's canonical multiderivations for reflection arrangements
• Recursively free reflection arrangements
• Divisionally free restrictions of reflection arrangements
• Reflection arrangements are hereditarily free
• Supersolvable restrictions of reflection arrangements
• On inductively free reflection arrangements.
• Flag-accurate arrangements
• Inductively free multiderivations of braid arrangements
• Nice restrictions of reflection arrangements
• Localizations of Inductively Factored Arrangements

Describes a project that uses

Uses Software

• GAP
• SageMath
• SINGULAR
• CHEVIE

This page was built for publication: On inductively free restrictions of reflection arrangements.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406361)