Abstract
Let P be a finite ordered set, and let J( P) be the distributive lattice of order ideals of P. The covering relations of J( P) are naturally associated with elements of P; in this way, each element of P defines an involution on the set J( P). Let Γ( P) be the permutation group generated by these involutions. We show that if P is connected then Γ( P) is either the alternating or the symmetric group. We also address the computational complexity of determining which case occurs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
