Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

We just finished a lesson about determinants and the symmetric group with all what comes with it ( permutations, transpositions etc... ), except we didn't do group theory ( we only see it next year ), just some general algebra. But I'd like to know if there are some nice problems online about permutations ( like for example Muirhead's inequality ).

Thanks !

share|cite|improve this question
"Nice" is such a personal thing...and without grout theory that's even more limited. Also I'm not sure how Muirhead's ineq. fits in here... – DonAntonio May 21 '12 at 11:21
Grout theory? Well, I guess you can apply it to tilings.... – Gerry Myerson May 21 '12 at 12:50
I don't know if they are available on-line, but John D. Dixon's Problems in Group Theory (Dover) Chapter 2 is about permutation groups, and de Souza and Silva's Berkeley Problems in Mathematics, section 6.5, is about $S_n$, $A_n$, $D_n$, etc. – Arturo Magidin May 21 '12 at 16:39

Your question is very general and you should probably specify what you are looking for exactly. One thing I always like to do when students learn about the symmetric group for the first time is talk about the Futurama episode The prisoner of Benda where they ask a question about permutations and even provide an explicit, mathematically correct proof of the solution.

share|cite|improve this answer
And this video: explains the episode and the proof very well. – Sam Jones May 21 '12 at 12:20

Let $1 < m < n$. Show that $\langle (1 2 \cdots m), (1 2 \cdots n) \rangle$ has a $3$-cycle. (I was trying to remember a problem that I have done in Isaacs' book. I might have remembered wrong, though I think it's right. But since you want a problem, if the statement is wrong, just tweak the problem and prove it wrong.)

share|cite|improve this answer
Personally, this was one of the problems that I think was good to get my hands dirty when it comes to understanding some elementary computations and lemmas of symmetric groups. – user123454321 Jan 19 '13 at 3:35

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.