Coxeter multiarrangements with quasi-constant multiplicities

We study structures of derivation modules of Coxeter multiarrangements with quasi-constant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with quasi-constant multiplicity is combinatorially computable.

Saved in:
Bibliographic Details
Published inJournal of algebra Vol. 322; no. 8; pp. 2839 - 2847
Main Authors Abe, Takuro, Yoshinaga, Masahiko
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.10.2009
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We study structures of derivation modules of Coxeter multiarrangements with quasi-constant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with quasi-constant multiplicity is combinatorially computable.
ISSN:0021-8693
1090-266X
DOI:10.1016/j.jalgebra.2009.07.025