Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Mathematics GRADUATE SEMINAR
 

Summary: Mathematics
and
Statistics
GRADUATE SEMINAR
Bahman Ahmadi
Maximum Intersecting Sets of Permutations in
Permutation Groups
PhD Student supervised by K. Meagher
Friday February 17th
14:30
CL 232
Abstract: The well-known Erdos-Ko-Rado (or EKR) theorem in extremal set
theory provides an upper bound on the size of an intersecting family of k-subsets
on an n-set and classifies the intersecting families which meet the bound. There
are remarkable results with similar characteristics as EKR theorem when the
concept of set is replaced by other mathematical objects with appropriate "in-
tersecting" relations. For instance, consider the symmetric group Sym(n). Any
two permutation , Sym(n) are called intersecting if there exists a point
x {1, . . . , n} such that (x) = (x). A set of permutations S Sym(n) is
intersecting if any pair of elements of S is intersecting. Then, a theorem similar

  

Source: Argerami, Martin - Department of Mathematics and Statistics, University of Regina

 

Collections: Mathematics