Coxeter multiarrangements with quasi-constant multiplicities
Takuro Abe, Masahiko Yoshinaga
TL;DR
This paper investigates the derivation modules of Coxeter multiarrangements with quasi-constant multiplicities, demonstrating that their characteristic polynomials can be computed combinatorially using primitive derivations.
Contribution
It introduces a method to analyze derivation modules of Coxeter multiarrangements with quasi-constant multiplicities and shows their characteristic polynomials are combinatorially computable.
Findings
Derivation modules are structured via primitive derivations.
Characteristic polynomials are explicitly computable.
Method applies to Coxeter multiarrangements with quasi-constant multiplicities.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · semigroups and automata theory