Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.13492 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908325772263424 |
|---|---|
| author | Chenevière, Clément Fang, Wenjie Henriet, Corentin |
| author_facet | Chenevière, Clément Fang, Wenjie Henriet, Corentin |
| contents | The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015). However, their definitions do not provide a practical setup to work with combinatorially. In this paper, we provide a new equivalent definition of the m-Cambrian lattices on simple objects called m-noncrossing partitions, using a simple and effective comparison criterion. It is obtained by showing that each interval has a unique maximal chain that is c-increasing, which is computed by a greedy algorithm. Our proof is uniform, involving all Coxeter groups and all choices of Coxeter element at the same time. This work has been accepted as an extended abstract for the FPSAC 2025 conference. A long version of this work will be available later. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_13492 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A new definition for m-Cambrian lattices Chenevière, Clément Fang, Wenjie Henriet, Corentin Combinatorics The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015). However, their definitions do not provide a practical setup to work with combinatorially. In this paper, we provide a new equivalent definition of the m-Cambrian lattices on simple objects called m-noncrossing partitions, using a simple and effective comparison criterion. It is obtained by showing that each interval has a unique maximal chain that is c-increasing, which is computed by a greedy algorithm. Our proof is uniform, involving all Coxeter groups and all choices of Coxeter element at the same time. This work has been accepted as an extended abstract for the FPSAC 2025 conference. A long version of this work will be available later. |
| title | A new definition for m-Cambrian lattices |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2504.13492 |