Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.13492

A new definition for m-Cambrian lattices

Clément Chenevière·Wenjie Fang·Corentin Henriet
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Clément Chenevière, Wenjie Fang, Corentin Henriet. 2025-04-18. A new definition for m-Cambrian lattices. https://arxiv.org/abs/2504.13492

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO↗
arXiv2026

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO↗