Separating trees and simple congruences of the weak order
European Journal of Combinatorics · 2026-07 · 136 · 104375
DOI: 10.1016/j.ejc.2026.104375 ↗Kurz gefasst
Fachartikel in der Zeitschrift European Journal of Combinatorics, 2026-07. Verfasst von Emily Barnard und 2 weiteren Autor:innen. Die Arbeit nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Agencia Estatal de Investigación, Generalitat de Catalunya, España Ministerio de Ciencia e Innovación.
Abstract (Originalsprache)
A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a combinatorial description of the vertices of the corresponding quotientopes in terms of separating trees. This also yields a combinatorial description of all faces of the corresponding quotientopes. We finally explore algebraic aspects of separating trees, in particular their connections with quiver representation theory.
Förderung
- Agencia Estatal de Investigación
- Generalitat de Catalunya
- España Ministerio de Ciencia e Innovación
- Deutsche Forschungsgemeinschaft
- Agence Nationale de la Recherche
Zitieren
APA
Barnard, E., Novelli, J., & Pilaud, V. (2026). Separating trees and simple congruences of the weak order. European Journal of Combinatorics, 136, 104375. https://doi.org/10.1016/j.ejc.2026.104375
Vancouver
Barnard E, Novelli J, Pilaud V. Separating trees and simple congruences of the weak order. European Journal of Combinatorics. 2026;136:104375. doi:10.1016/j.ejc.2026.104375
BibTeX
@article{Barnard2026,
author = {Barnard, Emily and Novelli, Jean-Christophe and Pilaud, Vincent},
title = {Separating trees and simple congruences of the weak order},
journal = {European Journal of Combinatorics},
year = {2026},
volume = {136},
pages = {104375},
doi = {10.1016/j.ejc.2026.104375}
}
EUVIMED