a permutation group determined by an ordered set：由有序集确定的置换群.pdf

Discrete Mathematics 269 (2003) 273 –279 /locate/disc Note A permutatio ngroup determined by a nordered set a b b ; 1 Anders Claesso , Chris D. Godsil , David G. Wagner a Department of Mathematics, Chalmers University of Technology, S-412 96 Goteborg, Sweden b Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada N2L 3G1 Received 29 July 2002; received i nrevised form 19 March 2003; accepted 24 March 2003 Abstract Let P be a nite 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 ; i nthis way, each element of P denes a ninvolutio no nthe set J (P ). Let (P ) be the permutatio ngroup generated by these involutions. We show that if P is co ected the (P ) is either the alternating or the symmetric group. We also address the computational complexity of determining which case occurs. c 2003 Elsevier B.V. All rights reserved. Keywords: Ordered set; Distributive lattice; Permutatio ngroup Let P be a nite ordered set, and let J (P ) be the distributive lattice of order ideals (also called down-sets) of P . For each p ∈P , dene a permutatio p o J (P ) as follows: for every S ∈J (P ),  S ∪ {p} if p is minimal i P \S;   p(S ) := S \{p} if p is maximal i S;