2
votes
2answers
181 views

Minimal *-idempotents for the group algebra of the symmetric group

There is a well-known construction of minimal idempotents in the group algebra of the symmetric group $\mathbb C[S_n]$ using row symmetrizers and column antisymmetrizers. But these idempotents are ...
4
votes
4answers
452 views

Structure of the adjoint representation of a (finite) group (Hopf algebra) ?

Every group acts on itself by conjugation $h \mapsto g h g^{-1}$. Respectively considering functions on a group we obtain a linear representation. Question 1: what is known about this representation ...
6
votes
2answers
459 views

Word length in the symmetric group

Let $n \geq 1$ and let $H_n$ be a 2-Sylow subgroup of the symmetric group $\mathrm{Sym}(2^n)$. Let also consider the cycle $\gamma_n = (1, \ldots, 2^n)$ of order $2^n$. If we assume moreover that ...
9
votes
4answers
852 views

Number of Permutations?

Edit: This is a modest rephrasing of the question as originally stated below the fold: for $n \geq 3$, let $\sigma \in S_n$ be a fixed-point-free permutation. How many fixed-point-free permutations ...
-2
votes
1answer
217 views

A generalization of an old group problem [closed]

Here is an old exercise in group theory: (1) If $G$ is a group of order $2n$ with $n$ odd then $G$ is not simple and in fact $G$ has a normal subgroup of order $n$. I am going for one straight ...
16
votes
1answer
428 views

What is the length of the shortest law of $S_n$?

What is the length of the shortest word $w\in F_2$ such that $w(x,y)$ is trivial for every $x,y\in S_n$? There is a simple argument showing that we must have $\ell(w)\geq n$. See here for instance. ...
13
votes
4answers
618 views

Largest permutation group without 2-cycles or 3-cycles

The largest permutation group without 2-cycles is $A_n$, which has size $n!/2$. I think the largest permutation group without 2-cycles or 3-cycles is much smaller, but I can't figure out if it should ...
1
vote
1answer
551 views

How to solve a system of equations over permutations?

Imagine you have a $n\times n$ matrix filled in with permutations over $n$ elements. Now you pick one permutation from each row randomly starting from the first row and by multiplying them get a ...
6
votes
2answers
435 views

Algorithm for reducing words in a Coxeter group

Let $W$ be a Coxeter group with set of simple reflections $S$. Suppose that I have chosen a preferred reduced decomposition for every element of $W$. Given an arbitrary word in the alphabet $S$, is ...
3
votes
1answer
384 views

2 Possible Generalizations of Cayley's Theorem?

I'm wondering about the following 2 generalizations of Cayley's Theorem (every group embeds in a symmetric group). If these are known to be true/false, references would be appreciated. 1) (Weak ...
3
votes
0answers
595 views

Necklaces and the generating function for inversions

The problem of Necklaces is well-known, i.e "The number of fixed necklaces of length $n$ composed of $a$ types of beads $N(n,a)$" can be calculated: http://mathworld.wolfram.com/Necklace.html Let us ...
4
votes
0answers
348 views

Partial order on partitions and symmetric group algebra

Let $n$ be a natural number. Consider a set $\Lambda_n$ of partitions of $n$ into a sum of natural numbers, like $n = \lambda_1 + \cdots +\lambda_k$ (A set of small lambdas representing a partition is ...
4
votes
1answer
270 views

Faithful transitive actions by large groups on small sets

How large is the largest transitive subgroup of $S_n$ other than itself and $A_n$? In particular, does its size grow at least exponentially in $n$?
18
votes
5answers
1k views

Why are Jucys-Murphy elements' eigenvalues whole numbers?

The Jucys-Murphy elements of the group algebra of a finite symmetric group (here's the definition in Wikipedia) are known to correspond to operators diagonal in the Young basis of an irreducible ...
20
votes
1answer
588 views

Is there an easy description of the structure of this infinite group?

Let $S_\infty$ denote the full symmetric group on countably many points and index the points by $\mathbb{N}$. For any weight (for lack of a better name) function $w:\mathbb{N}\rightarrow\mathbb R^+$, ...
0
votes
2answers
492 views

Lie algabra of symmetric group

It's easy to see that the descending central series of a group induces a graded Lie algebra .(see for example Serre's Harvard lectures or Magnus-Solitar book). I think in general this can be ...
13
votes
2answers
2k views

roots of permutations

Consider equation $x^2=x_0$ in symmetric group $S_n$, where $x_0\in S_n$ is fixed. Is it true that for each integer $n\geq 1$, the maximal number of solutions (square roots) has identity permutation? ...
12
votes
5answers
1k views

A general formula for the number of conjugacy classes of $\mathbb{S}_n \times \mathbb{S}_n$ acted on by $ \mathbb{S}_n$

$\def\S{\mathbb{S}}$ Dear all, So I have $\S_n$ acting on $\S_n \times \S_n$ via conjugacy. That is: for $g \in \S_n, (x,y) \in \S_n \times \S_n$: $g(x,y) = (gxg^{-1},gyg^{-1}).$ Is there a general ...