Combinatorics of \((m, n)\)-word lattices

DOI10.37236/12906MaRDI QIDQ6635155

Henri Mühle

Publication date: 9 November 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Other generalizations of distributive lattices (06D75)

Cites Work

• Unnamed Item
• Unnamed Item
• Noncrossing partitions and the shard intersection order
• An analogue of distributivity for ungraded lattices
• The bitwisted Cartesian model for the free loop fibration
• Posets of shuffles
• Primes, irreducibles and extremal lattices
• Some properties of a new partial order on Dyck paths
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• A geometric and combinatorial exploration of Hochschild lattices
• Hochschild lattices and shuffle lattices
• On the number of full reflections in finite Coxeter groups.
• Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
• Doubling Constructions in Lattice Theory
• The Factorization and Representation of Lattices
• A combinatorial model for the free loop fibration
• Rowmotion in slow motion
• Bubble lattices. I: Structure

This page was built for publication: Combinatorics of \((m, n)\)-word lattices