2000 character limit reached
Bruhat order on plane posets and applications
Published 23 Nov 2012 in math.RA | (1211.5449v1)
Abstract: A plane poset is a finite set with two partial orders, satisfying a certain incompatibility condition. The set PP of isoclasses of plane posets owns two products, and an infinitesimal Hopf algebra structure is defined on the vector space H_PP generated by PP, using the notion of biideals of plane posets. We here define a partial order on PP, making it isomorphic to the set of partitions with the weak Bruhat order. We prove that this order is compatible with both products of PP; moreover, it encodes a non degenerate Hopf pairing on the infinitesimal Hopf algebra H_PP.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.