
TL;DR
This paper generalizes a monoid structure on subsets of Coxeter groups, originally constructed for Weyl groups, to all finite Coxeter groups using elementary combinatorics, and provides explicit calculations for each type.
Contribution
It extends the monoid construction from Weyl groups to all finite Coxeter groups with an elementary combinatorial approach and explicit type-by-type calculations.
Findings
Monoid structure is generalized to all finite Coxeter groups.
Explicit calculations of the monoid for each Coxeter group type.
Elementary combinatorial methods are used for the generalization.
Abstract
Let be a finite Coxeter group. In the case where is a Weyl group, Berenstein and Kazhdan in \cite{BK} constructed a monoid structure on the set of all subsets of using unipotent -linear bicrystals. In this paper, we will generalize this result to all types of finite Coxeter groups (including non-crystallographic types). Our approach is more elementary, based on some combinatorics of Coxeter groups. Moreover, we will calculate this monoid structure explicitly for each type.
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 · Advanced Mathematical Identities · Algebraic structures and combinatorial models
