University of Cambridge > Talks.cam > Algebra and Representation Theory Seminar > Orbit-coherence in permutation groups

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Orbit-coherence in permutation groups

Download to your calendar using vCal

  • UserJohn Britnell, Imperial College
  • ClockWednesday 04 June 2014, 16:30-17:30
  • HouseMR12.

If you have a question about this talk, please contact David Stewart .

For a permutation g of a set X, let p(g) be the partition of X given by the orbits of g. For a permutation group G on X, let p(G) be the set of partitions p(g) for g in G. The set of all partitions of X forms a complete lattice under the refinement order, and it makes sense to look at the order-theoretic properties of the subset p(G).

I shall talk about joint work with Mark Wildon (Royal Holloway), on permutation groups G for which p(G) is an upper- or lower-semilattice. In either case, this is a highly restrictive condition on G, but there are many interesting examples, in both finite and infinite degree. In particular, the centralizer in Sym(X) of an element g is always a lower-semilattice, and, subject to a finiteness condition on the cycles of g, a lattice.

This talk is part of the Algebra and Representation Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Classroom, Department of Architecture, 1-5 Scroope Terrace, Cambridge Museum of Archaeology & Anthropology Room 1S3, Donald McIntyre Building, Faculty of Education, 184 Hills Road, Cambridge CB2 8PQ

Other talks

A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Early cancer clinical trials Title tbc Title to be confirmed Title to be confirmed Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity