Bubble Lattices I: Structure
arXiv:2202.02874 · doi:10.1007/s00012-024-00842-y
Abstract
C. Greene introduced the shuffle lattice as an idealized model for DNA mutation and discovered remarkable combinatorial and enumerative properties of this structure. We attempt an explanation of these properties from a lattice-theoretic point of view. To that end, we introduce and study an order extension of the shuffle lattice, the bubble lattice. We characterize the bubble lattice both locally (via certain transformations of shuffle words) and globally (using a notion of inversion set). We then prove that the bubble lattice is extremal and constructable by interval doublings. Lastly, we prove that our bubble lattice is a generalization of the Hochschild lattice studied earlier by Chapoton, Combe and the second author.
arXiv comment24 pages, 8 figures. Comments are welcome
References in corpus (8)
- Clusters, Coxeter-sortable elements and noncrossing partitions
- Noncrossing partitions and the shard intersection order
- Rowmotion in slow motion
- The Core Label Order of a Congruence-Uniform Lattice
- Hochschild lattices and shuffle lattices
- Noncrossing Arc Diagrams, Tamari Lattices, and Parabolic Quotients of the Symmetric Group
- Meet-Distributive Lattices have the Intersection Property
- Extremality, Left-Modularity and Semidistributivity