Cambrian lattices. (Q2504373): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.aim.2005.07.010 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4212973280 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0402086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiber polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated fiber polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable nonpure complexes and posets. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the self-linking of knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cayley lattices of finite Coxeter groups are bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruences in ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopal Realizations of Generalized Associahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruence normality: The characterization of the doubling class of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster algebras. II: Finite type classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(Y\)-systems and generalized associahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributivity of a lattice of lattice-congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tamari lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4303668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of the Stasheff polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized associahedra via quiver representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order dimension, strong Bruhat order and lattice properties for posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice congruences of the weak order. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice congruences, fans and Hopf algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clusters, Coxeter-sortable elements and noncrossing partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sortable elements and Cambrian lattices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-crossing partitions for classical reflection groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivariant fiber polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-B associahedron. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The patterns of permutations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AIM.2005.07.010 / rank
 
Normal rank

Latest revision as of 02:11, 19 December 2024

scientific article
Language Label Description Also known as
English
Cambrian lattices.
scientific article

    Statements

    Cambrian lattices. (English)
    0 references
    0 references
    25 September 2006
    0 references
    Let \((W,S)\) be a Coxeter system. The elements of \(S\) are called simple reflections and conjugates of simple reflections are called reflections. The left inversion set of \(w\), denoted \(I(w)\), is the set of all (not necessarily simple) reflections \(t\) such that \(l(tw)<l(w)\). The length \(l(w)\) is equal to \(|I(w)|\). The right weak order on \(W\) is the partial order which sets \(v\leq w\) if and only if \(I(v)\subset I(w)\). The term ``weak order'' always refers to the right weak order. For an arbitrary finite Coxeter group \(W\), the author defines the family of Cambrian lattices for \(W\) as quotients of the weak order on \(W\) with respect to certain lattice congruences. The author associates to each Cambrian lattice a complete fan. In types \(A\) and \(B\) the author obtains, by means of a fiber-polytope construction, combinatorial realizations of the Cambrian lattices in terms of triangulations and in terms of permutations. Using this combinatorial information, the author proves in types \(A\) and \(B\) that the Cambrian fans are combinatorially isomorphic to the normal fans of the generalized associahedra and that one of the Cambrian fans is linearly isomorphic to Fomin and Zelevinsky's construction of the normal fan as a ``cluster fan''. The author also shows that open intervals in Cambrian lattices are either contractible or homotopy equivalent to spheres.
    0 references
    clusters
    0 references
    fiber polytopes
    0 references
    generalized associahedra
    0 references
    lattice congruences
    0 references
    lattice quotients
    0 references
    Tamari lattices
    0 references
    Cambrian lattices
    0 references
    posets of regions
    0 references
    simplicial hyperplane arrangements
    0 references
    weak orders
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references