Hochschild lattices and shuffle lattices

DOI10.1016/J.EJC.2022.103521MaRDI QIDQ6348034arXivFDO

Authors Henri Mühle

Publication date 30 August 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.EJC.2022.103521

Mathematics Subject Classification ID

Enumerative combinatorics (05Axx) Combinatorial aspects of representation theory (05E10) Lattices (06Bxx) Other generalizations of distributive lattices (06D75)

arXiv classification

math.CO

Abstract: In his study of a Hochschild complex arising in connection with the free loop fibration, S. Saneblidze defined the freehedron, a certain polytope constructed via a truncation process from the hypercube. It was recently conjectured by F. Chapoton and proven by C. Combe that a certain orientation of the $1$-skeleton of the freehedron carries a lattice structure. The resulting lattice was dubbed the Hochschild lattice and is congruence uniform and extremal. These properties allow for the definition of three associated structures: the Galois graph, the canonical join complex and the core label order. In this article, we study and characterize these structures. We exhibit an isomorphism from the core label order of the Hochschild lattice to a particular shuffle lattice of C. Greene. We also uncover an enumerative connection between the core label order of the Hochschild lattice, a certain order extension of its poset of irreducibles and the freehedron. These connections nicely parallel the situation surrounding the better-known Tamari lattices, noncrossing partition lattices and associahedra.

This page was built for publication: Hochschild lattices and shuffle lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348034)