# Counting Permutations

 dc.contributor.author Purdy, Alison dc.date.accessioned 2011-04-21T21:56:42Z dc.date.available 2011-04-21T21:56:42Z dc.date.issued 2011-04-02 dc.identifier.uri http://hdl.handle.net/10294/3332 dc.description.abstract Suppose we have an orange, an apple and a pear. How many different ways can we arrange these three? The answer is six – OAP, APO, PAO, OPA, AOP, POA. These arrangements are called permutations. Now, how large a collection of these arrangements can we have so that any two arrangements have one fruit in the same position? With our three fruit, the answer is two. One example would be OAP and OPA. The answer isn’t quite so easy if we start with a larger set of objects. You would probably be surprised at the number of years it took for mathematicians to prove an answer that would apply to any number of objects. It turns out that the best approach is to have one object in the same position in all the arrangements. What happens if any two arrangements must have two objects in the same positions? What about more than two? How large a collection of permutations will meet these constraints? Recently, Ellis, Friedgut and Pilpel arrived at a partial answer to this question. In the research for my Master's thesis at the University of Regina, I used a different approach in an attempt to solve this problem. I will present these two results and discuss the relative strengths of each. en_US dc.language.iso en en_US dc.publisher University of Regina Graduate Students' Association en_US dc.relation.ispartofseries Session 5.5 en_US dc.subject Permutations en_US dc.subject Discrete mathematics en_US dc.subject Extremal set theory en_US dc.title Counting Permutations en_US dc.type Presentation en_US dc.description.authorstatus Student en_US dc.description.peerreview yes en_US
﻿