Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0606201

Cambrian fans

Nathan Reading·David E Speyer
View original source ↗Read source document ↗Export metadata ↓

Abstract

For a finite Coxeter group W and a Coxeter element c of W, the c-Cambrian fan is a coarsening of the fan defined by the reflecting hyperplanes of W. Its maximal cones are naturally indexed by the c-sortable elements of W. The main result of this paper is that the known bijection cl_c between c-sortable elements and c-clusters induces a combinatorial isomorphism of fans. In particular, the c-Cambrian fan is combinatorially isomorphic to the normal fan of the generalized associahedron for W. The rays of the c-Cambrian fan are generated by certain vectors in the W-orbit of the fundamental weights, while the rays of the c-cluster fan are generated by certain roots. For particular ("bipartite") choices of c, we show that the c-Cambrian fan is linearly isomorphic to the c-cluster fan. We characterize, in terms of the combinatorics of clusters, the partial order induced, via the map cl_c, on c-clusters by the c-Cambrian lattice. We give a simple bijection from c-clusters to c-noncrossing partitions that respects the refined (Narayana) enumeration. We relate the Cambrian fan to well known objects in the theory of cluster algebras, providing a geometric context for g-vectors and quasi-Cartan companions.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nathan Reading, David E Speyer. 2008-11-24. Cambrian fans. https://doi.org/10.4171/jems%2F155

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

KEEP EXPLORING

Related papers

arXiv2026

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO↗
arXiv2026

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO↗
arXiv2026

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO↗