 |
Discrete Mathematics & Theoretical Computer Science |
Chris Berg ; Nantel Bergeron ; Sandeep Bhargava ; Franco Saliola - Primitive orthogonal idempotents for R-trivial monoids
dmtcs:2896 - Discrete Mathematics & Theoretical Computer Science, January 1, 2011, DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011) - https://doi.org/10.46298/dmtcs.2896Primitive orthogonal idempotents for R-trivial monoidsConference paper
Authors: Chris Berg 1,2; Nantel Bergeron 
1,2; Sandeep Bhargava 1,2; Franco Saliola 1,2,3
- 1 Fields Institute for Research In Mathematical Sciences
- 2 York University [Toronto]
- 3 Laboratoire de combinatoire et d'informatique mathématique [Montréal]
[en]
We construct a recursive formula for a complete system of primitive orthogonal idempotents for any R-trivial monoid. This uses the newly proved equivalence between the notions of R-trivial monoid and weakly ordered monoid.
[fr]
Nous construisons une formule récursive pour un système complet d'idempotents orthogonaux primitifs pour tout monoïde R-trivial. Nous employons une nouvelle équivalence entre les notions de monoïde R-trivial et de monoïde faiblement ordonné.
Source: HAL:hal-01215086v1
Volume: DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Section: Proceedings
Published on: January 1, 2011
Imported on: January 31, 2017
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] monoids, primitive orthogonal idempotents, 0-Hecke algebras, left regular bands
Funding:
- Source : OpenAIRE Graph
- Funder: Natural Sciences and Engineering Research Council of Canada
14 Documents citing this article
Consultation statistics
This page has been seen 376 times.
This article's PDF has been downloaded 473 times.