The symmetric group $S_n$ is the group of permutations of the set of integers $\{1,\dots,n\}$. This has $n!$ elements and is generated by the $n-1$ involutions exchanging consecutive integers. The symmetric groups form the simplest family of Coxeter groups.

learn more… | top users | synonyms

0
votes
0answers
41 views

Decomposition of polynomial ring as $S_n$-module [migrated]

I want to whether there is a containment relation between the $S_n$-modules $\mathbb{C}S_n$ and $\mathbb{C}[x_1,\ldots ,x_n]$. Is it true that $\mathbb{C}[x_1,\ldots ,x_n]$ contains an isomorphic copy ...
5
votes
1answer
276 views

Which subgroup order of the symmetric group is the most frequent?

Question: What is the most frequent order of subgroups of $S_n$? More precisely: Let $a_k$ be the number of subgroups of $S_n$ with order $k$. What is the maximum of $a_k$? This question came up ...
1
vote
0answers
97 views

What is the definition of plethysm in the representation theory of permutation groups

Let $s_\lambda \circ s_\mu$ be a plethysm. Here let $\lambda, \mu$ be $m,n$ box Young diagrams. I have seen the definition of plethysms in symmetric functions. I would like to understand the ...
1
vote
0answers
82 views

Character sums over a fixed subset of skew tableaux

Let $f(\lambda)$ count the number standard young tableaux of shape $\lambda\vdash n$ and $\lambda=(\lambda_1,\cdots,\lambda_r)$. Let $\mu \vdash k$ be a partition for $k<n$. It is a consequence of ...
18
votes
0answers
329 views

Nekrasov-Okounkov hook length formula

I am now reading the paper An explicit expansion formula for the powers of the Euler Product in terms of partition hook lengths by Guo-Niu Han. The author rediscovered what he calls Nekrasov-Okounkov ...
3
votes
3answers
369 views

Polynomials of low degree that clone polynomials of higher degree

Let $f(x_1,\dots,x_{16})=(x_1+x_2+x_3+x_4)(x_5+x_6+x_7+x_8)(x_9+x_{10}+x_{11}+x_{12})(x_{13}+x_{14}+x_{15}+x_{16})\in\Bbb R[x]$. Let $\mathcal{Z}$ be the zero set of $f$ in ...
2
votes
0answers
82 views

Permutation-invariant matrix representation

The question guide says that Mathoverflow is for research level mathematics. While I do not perform research in mathematics (I study quantum chemistry), I believe this question is research-level ...
7
votes
4answers
348 views

Is there a non-explicit characterization of the Specht modules?

It is a basic fact about the symmetric group $S_n$ that its irreducible representations are indexed by partitions of $n$. My question is, can the association between partitions and irreps be ...
3
votes
0answers
145 views

Is there any good survey on the hook length formula and related topics?

I am recently doing some research related to the hook length formula. The hook formula counts the number of Young tableaux of certain type. I find there are plenty of research already been done and ...
1
vote
0answers
99 views

Integral Cohomology of Symmetric Groups

Does anybody know a reference for the explicit description of the integral cohomology ring of $S_5$ and $S_6$. I can not find them anywhere in the internet. For $S_4$, I found C. B. Thomas's nice ...
4
votes
1answer
226 views

Decomposing $(\mathbb C^n)^{\otimes m}$ as a representation of $S_n\times S_m$

$V=\mathbb C^n$ is a $\mathbb CS_n$-module, where $S_n$ is the symmetric group of degree $n$, via the representation sending a permutation to the corresponding permutation matrix. The tensor power ...
2
votes
0answers
97 views

Adding a row to a Young Tableau via Novelli-Pak-Stoyanovskii

Let $T_{\lambda}$ be the set of standard young tableaux (SYT) of shape $\lambda_1\geq \lambda_2\cdots\geq \lambda_n$. Now consider pushing a row $\mu$ with $\mu\geq \lambda_1$ onto $Y$ to give shape ...
2
votes
0answers
80 views

Exact growth rate of Longest Increasing Subsequence expectation

Let $S_n$ be the symmetric group, $\pi\in S_n$ a uniformly random permutation and $L_n:=L_n(\pi)$ denoting the length of the longest increasing subsequence (LIS). We know that ...
2
votes
1answer
308 views

cohomology ring of symmetric group of order $3$

Let $S_3$ be the symmetric group of order $3$. What is the cohomology ring $$ H^*(S_3;\mathbb{Z})?$$ My attempt: I want to use mathematical induction on $n$ for $S_n$. For $n=1$, $S_1$ is trivial. ...
81
votes
4answers
3k views

What do the stable homotopy groups of spheres say about the combinatorics of finite sets?

The Barratt-Priddy-Quillen(-Segal) theorem says that the following spaces are homotopy equivalent in an (essentially) canonical way: $\Omega^\infty S^\infty:=\varinjlim~ \Omega^nS^n$ ...
6
votes
1answer
278 views

Decomposition of $\mathrm{End}(V)$ as $S_n\times S_n$-module

Let $V$ be a finite-dimensional, complex vector space and set $\newcommand{\Gl}{\mathrm{Gl}}G:=\Gl(V)\times\Gl(V)$. Let $E:=\mathrm{End}(V)$ and consider its coordinate ring $\mathbb C[E]$, the space ...
16
votes
2answers
996 views

Has Reifegerste's Theorem on RSK and Knuth relations received a slick proof by now?

For the notations I am using, I refer to the Appendix at the end of this post. Here is what, for the sake of this post, I consider to be Reifegerste's theorem: Theorem 1. Let $n\in\mathbb N$ and ...
5
votes
1answer
342 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$?
11
votes
0answers
154 views

What Is The Minimal Monomial of the Symmetric Group?

In the symmetric group $S_n$ what is the shortest sequence $c_1,\ldots,c_k\in S_n$ such that, for all $x\in S_n$ the following product of conjugates of $x$: $$x^{c_1}x^{c_2}\ldots x^{c_k}$$ equals the ...
3
votes
0answers
50 views

Is $LIS(\pi)+LIS(\sigma)+LIS(\sigma\pi^{-1})$ lower bounded?

In the title, $LIS$ stands for the length of longest increasing subsequence and Greek letters stand for permutations from symmetric group $S_n$. Considering some cases such as ...
1
vote
0answers
74 views

research on the structure/properties of permutation matrix/table with $(i,j)th$ entry as $\pi_j\circ \pi_i^{-1}$

Is there any research on the structure/properties of permutation matrix/table with $(i,j)th$ entry as $\pi_j\circ \pi_i^{-1}$, where $\{\pi_1,\pi_2,...,\pi_{k!}\}=S_k$? I know if we apply the ...
18
votes
1answer
747 views

Conjectural identities for Young symmetrizers and Young-Jucys-Murphy elements

The following questions I have found in my own notes from about 3 years ago. Unfortunately, I lost much of the context; I believe I made these conjectures reading Okounkov-Vershik, arXiv:0503040v3, ...
2
votes
0answers
122 views

Special sets of involutions generating ${\rm S}_n$

For which positive integers $k$ and $r$ are there involutions $g_{n,i} \in {\rm S}_n$ $(n \in \mathbb{N}, \ i = 1, \dots, k)$ such that the following hold?: for any $n$, the $g_{n,i}$ $(i = 1, ...
11
votes
1answer
531 views

Connected components $0-1$ matrices

Let $M$ be a $0-1$ matrix. Here a matrix has one component means we can traverse from a matrix entry $(i,j)$ which is $1$ to any other one by moving step of $(i\pm1,j),(i,j\pm1),(i\pm1,j\pm1)$ where ...
1
vote
0answers
119 views

Explicit basis/weight vectors for irreducibles inside the plethysm $Sym^m(\bigwedge^p \mathbf(V))$

This is a follow up to this question about finding the multiplicities of irreducible representations restricted to Young diagrams of 2-columns or less, inside the plethysm $Sym^m(\bigwedge^p ...
5
votes
0answers
209 views

In general, are 'Young symmetrisers' given by Littlewood-Richardson 'Orthogonal projection Operators'?

Consider $V^{\otimes n}$ where $V$ is vector space and the representation of GL(V) acting in the usual way. Now if I consider tensor products or plethysms of irreducible spaces, this is not in general ...
18
votes
6answers
725 views

Why is the right permutohedron order (aka weak order) on $S_n$ a lattice?

This is one of those things I never expected to be hard until I tried to prove it. Why is the right permutohedron order (a.k.a. weak Bruhat order, a.k.a. weak order -- not to be confused with the ...
4
votes
0answers
72 views

Name for class of flattening permutations

Let $S_n$ be the symmetric group. For any sequence of numbers $y=[y_1,y_2,\cdots,y_k]$, define the flattening operation as $\mbox{flatt}_{k}(y)$ as a relabeling of $y_1,y_2,\cdots,y_k$ in terms of ...
3
votes
1answer
65 views

Counting a Modified Class of Standard Young Tableau

Let $\lambda=(\lambda_1,\cdots,\lambda_n)$ be a partition, with $|\lambda|:=N$. Attach an extra box to $\lambda$ to the right end of the $r$'th row. In coordinate form, the last box on row $r$ has ...
1
vote
1answer
156 views

Homomorphisms from irreducible spaces to reducible spaces

Let $P_{\lambda}$ be a Young symmetriser associated to the following tableau $(a_1 a_2 a_3 b_3 ; b_1 b_2)$ where the entries seperated by the ; belong to first and second COLUMNS of the tableau. Take ...
4
votes
2answers
271 views

Isotypic components of the action of the symmetric group on polynomials

The polynomial ring $\mathbb{C}[x_1,\ldots,x_n]$ decomposes as a direct sum of isotypic components for the action of the symmetric group $S_n$. The isotypic component of the trivial representation is ...
4
votes
1answer
258 views

Minimum word length for an unusual set of generators of the symmetric group

Problem. Let $n\geq 2$ and let $T$ be the set of all permutations in $S_n$ of the form $$t_k:=\prod_{1\leq i\leq k/2}(i,k-i) \qquad \hbox{for $k=3,4,\ldots,n+1$}.$$ Find the least integer ...
2
votes
1answer
153 views

Number of double cosets of a Young subgroup

Let $\lambda\vdash n$ be a partition of $n$ with $k$ parts and $S_\lambda$ be a Young subgroup of $S_n$. Further let $S_\lambda\backslash S_n/ S_\lambda$ be the set of double-cosets. Now I would like ...
5
votes
1answer
181 views

Is there a bijection of permutations onto mathematical objects that preserve information about descents?

$\omega \in S_n$ is an FPFI (fixed point free involution) (also called a matching) if $\omega^2=1$ and $\omega(i) \neq i$ for all $i$. For $\omega \in S_n$, a descent occurs at $i$ if $\omega(i+1) ...
2
votes
0answers
676 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 ...
2
votes
1answer
161 views

Symmetric invariants of a Schur Module

Let $V\cong\mathbb C^n$ be a complex vector space of dimension $n$. Let $\lambda\in\mathbb Z^r$ be a generalized integer partition $\lambda_1\ge\cdots\ge\lambda_r$ with $r\le n$. Denote by $\mathbb ...
2
votes
1answer
169 views

counting the number of ordered pairs in a permutohedron

Recall that a permutohedron is a graph on the set of permutations $S_n$ with an edge between $\sigma$ and $\tau$ if they differ by one adjacent transposition: $\tau = (i,i+1) \circ \sigma$ for some $i ...
5
votes
2answers
406 views

What is natural about the well-known bijection between conjugacy classes and irreps of a symmetric group?

Symmetric groups possess a well-known bijection between conjugacy classes and irreducible representations. More precisely, both sets are indexed by Young diagrams. Question: To what extent is this ...
1
vote
1answer
187 views

A Simple Bijective Proof Of Stanley's Hook-Content Formula for Hook Shapes

this is my first post on math overflow so I hope it goes well. I believe I have a fairly simple bijective proof for Stanley's Hook-Content Formula in the case of hook shapes. I wanted to see if ...
2
votes
2answers
228 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 ...
0
votes
0answers
99 views

Geometric interpretation of table with permutations and inversions

Let $T(n,k)$ is the number of permutations of numbers $1, ..., n$ and each of the permutations has $k$ inversions. We can consider a table for $T(n,k)$ for some $n$ and $k$. For eg. $n=1,...,6$, ...
37
votes
3answers
2k views

What to do now that Lusztig's and James' conjectures have been shown to be false?

Lusztig and James provided conjectures for dimensions of simple modules (or decomposition numbers) for algebraic groups and symmetric groups in characteristic $p$. These conjectures have been ...
9
votes
1answer
355 views

The Simultaneous Conjugacy Problem in the symmetric group $S_N$

We are interested in the following notions in the case $G=S_N$, the symmetric group on $\{1,\dots,N\}$. Fix a group $G$ and a number $d$. For $(g_1,\dots,g_d)\in G^d$ and $x\in G$, define ...
14
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 ...
7
votes
1answer
557 views

Permutation character of the symmetric group on subsets of certain size

The symmetric group $S_n$ acts on $[n]:=\{1,\ldots,n\}$, thereby inducing an action on the set $$\wp_k(n)=\{\: A\subseteq[n] \::\: \#A=k \:\}$$ of subsets of cardinality $k$, simply by $$(g,A)\mapsto ...
4
votes
1answer
228 views

Expression of basis vectors of permutation modules in different bases.

This is a cross-post from math.se, because I did not get any answer there: Write $[n]:=\{1,\ldots,n\}$. For a partition $\lambda\vdash n$, I will write $[\lambda]$ for the Specht module that ...
10
votes
4answers
1k views

Cyclic Permutations - but not what you think

This question is not about elements of $S_n$ that consist of a single $n$-cycle, though naturally it's related. Instead, consider permutations modulo the action of $(123\ldots n)$. That is, we ...
10
votes
0answers
411 views

A $q$-analogue of Foulkes' character related to alternating permutations

My paper "Alternating permutations and symmetric functions" at http://math.mit.edu/~rstan/papers/altenum.pdf enumerates certain classes of alternating permutations, such as those whose inverse is ...
6
votes
3answers
374 views

Representations of S_n induced from centralizers of elements

Does anyone have a reference for a good description of representations of $S_{n}$ obtained by inducing up from $C_{S_{n}}(\pi)$, for some element $\pi$ of $S_{n}$? (I'd prefer an efficient ...
5
votes
4answers
667 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 ...