Coxeter multiarrangements with quasi-constant multiplicities
classification
🧮 math.CO
math.AC
keywords
coxeterquasi-constantderivationmultiarrangementsmultiplicitiesapplicationcharacteristiccombinatorially
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.