25 research outputs found
Simplex and Polygon Equations
It is shown that higher Bruhat orders admit a decomposition into a higher
Tamari order, the corresponding dual Tamari order, and a "mixed order." We
describe simplex equations (including the Yang-Baxter equation) as realizations
of higher Bruhat orders. Correspondingly, a family of "polygon equations"
realizes higher Tamari orders. They generalize the well-known pentagon
equation. The structure of simplex and polygon equations is visualized in terms
of deformations of maximal chains in posets forming 1-skeletons of polyhedra.
The decomposition of higher Bruhat orders induces a reduction of the
-simplex equation to the -gon equation, its dual, and a compatibility
equation
Brick polytopes, lattice quotients, and Hopf algebras
This paper is motivated by the interplay between the Tamari lattice, J.-L.
Loday's realization of the associahedron, and J.-L. Loday and M. Ronco's Hopf
algebra on binary trees. We show that these constructions extend in the world
of acyclic -triangulations, which were already considered as the vertices of
V. Pilaud and F. Santos' brick polytopes. We describe combinatorially a natural
surjection from the permutations to the acyclic -triangulations. We show
that the fibers of this surjection are the classes of the congruence
on defined as the transitive closure of the rewriting rule for letters
and words on . We then
show that the increasing flip order on -triangulations is the lattice
quotient of the weak order by this congruence. Moreover, we use this surjection
to define a Hopf subalgebra of C. Malvenuto and C. Reutenauer's Hopf algebra on
permutations, indexed by acyclic -triangulations, and to describe the
product and coproduct in this algebra and its dual in term of combinatorial
operations on acyclic -triangulations. Finally, we extend our results in
three directions, describing a Cambrian, a tuple, and a Schr\"oder version of
these constructions.Comment: 59 pages, 32 figure