A numerical characterization of Dunkl systems
Martin de Borbon, Dmitri Panov
TL;DR
This paper provides a numerical method to characterize weighted hyperplane arrangements that originate from Dunkl systems, enhancing understanding of their structure.
Contribution
It introduces a novel numerical characterization approach for hyperplane arrangements associated with Dunkl systems, which was not previously available.
Findings
Provides a new numerical criterion for Dunkl system arrangements
Enhances understanding of the structure of hyperplane arrangements
Bridges algebraic and geometric properties of Dunkl systems
Abstract
We give a numerical characterization of weighted hyperplane arrangements arising from Dunkl systems.
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
TopicsMathematical Analysis and Transform Methods · Holomorphic and Operator Theory · graph theory and CDMA systems