All Questions
36 questions
0
votes
0
answers
95
views
Class multiplication coefficients of symmetric groups
My question is that I was working with some counting problems, and finally the answer should be
$$
\nu_{\mu_1,\mu_2,\mu_3}=\#\{(\sigma_1,\sigma_2,\sigma_3): \sigma_1\sigma_2\sigma_3=1, \sigma_1\in C_{\...
1
vote
0
answers
130
views
Relationship between the symmetric group representation (Specht module) of a Young diagram and the Young diagram obtained by deleting one row
Suppose $\lambda$ is a Young diagram, and $\lambda'$ is obtained by deleting one particular row of $\lambda$. Is there any relationship between the symmetric group representation (Specht module) ...
- 25
5
votes
0
answers
200
views
Subgroups of the symmetric group and binary relations
Motivation
The following came up in my work recently. (NB this is the motivation, not the question I'm asking. You can skip to the actual question below, which is self-contained, but not self-...
- 756
3
votes
0
answers
121
views
Twisted permutations
We consider a set $E$ with an involution (having perhaps fixed points).
We denote orbits by $\lbrace x,\overline{x}\rbrace$ (with $\overline{x}=x$ in
the case of a fixed point).
We consider sequences $...
- 17.9k
2
votes
0
answers
184
views
The canonical automorphism of the symmetric group
Let $S_n$ be the symmetric group of order $n$. Denoting simple transpositions by $\sigma_i$ the collection $\sigma_1, \dots, \sigma_{n-1}$ generates $S_n$ subject to the following relations:
$$
\sigma ...
- 1,144
8
votes
2
answers
282
views
One element commutation classes of reduced decompositions of the longest element of the Weyl group
For the symmetric group on $n$ objects $S_n$ the question of how to write its longest element $w_0$ as a reduced decomposition is an important combinatorical problem. As example, in this question the ...
0
votes
1
answer
302
views
Lower bound of the largest irreducible character degree of alternating group $A_n$
$\newcommand\cd{\mathrm{cd}}$Let $A_m$ and $A_n$ be two alternating groups and $15\le m+2 \le n$. Denote $\cd_m$ and $\cd_n$ as the largest irreducible character degree of $A_m$ and $A_n$, ...
- 1
1
vote
1
answer
210
views
Words representations of elements of a symmetric group
Let $S=\{(1,2),(1,2,\ldots,n),(1,n,,n-1,\ldots,2)\}$ be a subset of the symmetric group $S_n$. Let $a=(1,2),b=(1,2,\ldots,n),c=(1,n,n-1\ldots,2)$ be the elements of $S$. My question is, since $S$ is a ...
- 2,089
1
vote
0
answers
103
views
Are there standard short notations for ascending and descending cyclic permutations?
In a paper I am currently writing I use cyclic permutations of the form
$$
(k,k+1,\dots,\ell)
$$
and
$$
(\ell,\ell-1,\dots,k)
$$
of consecutive elements quite a lot (I added the commas to avoid ...
- 7,127
20
votes
0
answers
451
views
Row of the character table of symmetric group with most negative entries
The row of the character table of $S_n$ corresponding to the trivial representation has all entries positive, and by orthogonality clearly it is the only one like this.
Is it true that for $n\gg 0$, ...
- 24.2k
6
votes
2
answers
325
views
Is there a combinatorial interpretation of this array in terms of $S_{2n+1}$?
I have recently encountered a triangular array $(a_{i,j})_{0\le i\le j}$, each line of which might (should?) have a combinatorial interpretation in terms of $S_{2n+1}$. Here it is (the first entry of ...
- 13.4k
0
votes
0
answers
126
views
Combinatorics of merging sequences from multinomial coefficients
If you have $m$ sequences $a_{11},\dots,a_{1n_1}$ through $a_{m1},\dots,a_{mn_m}$ each sorted in ascending order (assume there are no duplicates) then there is an unique way to merge them.
How many ...
- 1,826
11
votes
1
answer
550
views
Probability of words summing to $1$ in $S_n$ or $\mathrm{PGL}_2(n)$
$\DeclareMathOperator\PGL{PGL}\DeclareMathOperator\Conj{Conj}$Let $G$ be the symmetric group $S_n$ or the projective general linear group $\PGL_2(n)$.
Let $X$ be a cyclically reduced word in the ...
- 9,501
2
votes
1
answer
197
views
Enumeration and structure of abelian 2-subgroups of a symmetric group
I am struggling with a group theoretic problem arising in my research. Given a symmetric group $\Sigma_{n}$, let's consider all its abelian 2-subgroups up to conjugation. Is it possible to give a ...
- 311
1
vote
0
answers
176
views
Relation between groups $A_n$, $B_n$, $D_n$ and $S_n$ or inversions of random elements in Coxeter groups
First of of all I'm trying to find a general interpretation to the following facts below.
Let's look at the property of Kendall-Mann numbers $M(n)$ which are row maxima of Triangle of Mahonian ...
31
votes
2
answers
1k
views
Does the symmetric group $S_{10}$ factor as a knit product of symmetric subgroups $S_6$ and $S_7$?
By knit product (alias: Zappa-Szép product), I mean a product $AB$ of subgroups for which $A\cap B=1$. In particular, note that neither subgroup is required to be normal, thus making this a ...
- 1,068
4
votes
0
answers
266
views
Metrics on finite groups and generalizations of central limit theorems for balls volumes (à la Diaconis-Graham)
In wonderful lectures by P. Diaconis "Group representations in probability and statistics, Chapter 6. Metrics on Groups, and Their Statistical Use" metrics on permutation groups are considered and ...
- 24.9k
2
votes
0
answers
85
views
Permutation factorizations according to number of generated orbits
Let $\pi$ be a permutation in $S_n$ with cycle type $\lambda$.
How many factorizations into two factors $\pi=\sigma_1\sigma_2$ are there, such that the subgroup $\langle \sigma_1,\sigma_2\rangle$ ...
- 2,552
10
votes
1
answer
269
views
Edge-transitive Cayley graphs of $S_n$
I came across the following question which I haven't seen before:
Question. Fix $k\ge 3$. For infinitely many $n$, does there exists a generating set $\langle R_n \rangle = S_n$, $|R_n|=k$, such ...
- 17k
1
vote
2
answers
259
views
A question about set of inversion
Let $w \in S_n$ and $inv(w) = \{(i,j): i,j \in \{1,\ldots,n\}, i<j, w(i)>w(j)\}$ the inversion set of $w$. Let ${\bf i}=(i_1,\ldots,i_m)$ be a sequence such that $s_{i_1}\cdots s_{i_m}$ is a ...
- 6,201
1
vote
0
answers
285
views
Classification of transitive subgroups of finite symmetric groups generated by double transpositions
I want to classify (up to isomorphism) all transitive subgroups of symmetric group $S_n$ which are generated by double transpositions (product of two transpositions). Is there a characterization for ...
- 11
6
votes
1
answer
301
views
Reference request: Reduced reflection length in Coxeter groups
I recently read this paper, where the authors define on page 26 what they call the reduced reflection length. For that we take a Coxeter group $G$ with Coxeter generators $S$ and transpositions $T$. ...
- 809
9
votes
2
answers
762
views
Solutions of $x^d=1$ in the symmetric group
L Moser and M Wyman, On solutions of $x^d = 1$ in symmetric groups, Canad. J. Math., 7 (1955), pages 159-168, explored asymptotic behavior of the cardinality of such permutations:
$$f_d(n):=\#\{\pi\in\...
- 43.2k
3
votes
0
answers
226
views
$S_n$ action on the sequences of transpositions
It is well-known, that any element $\rho$ of the symmetric group $S_n$ with $n-p$ cycles admits a unique presentation as a product of a sequence of transpositions $\{(a_i\,b_i)\}_{i = 1}^p$ with $a_i &...
- 401
0
votes
1
answer
232
views
Number of Boolean algebra subintervals in weak order of $S_n$
I'm wondering if anybody has an easy way to compute the number of subintervals in weak order of $S_n$ (considered as a Coxeter group of type $A_{n-1}$) that are isomorphic to Boolean algebras. I know $...
- 2,168
3
votes
4
answers
610
views
Factorization in the group algebra of symmetric groups
Let $S_n$ be the symmetric group on $\{1, \ldots, n\}$. Let
\begin{align}
T=\sum_{g\in S_n} g.
\end{align}
Are there some references about the factorization of $T$?
In the case of $n=3$, we have
\...
- 6,201
5
votes
1
answer
204
views
A decomposition of $w_0$ which is similar to the reduced decomposition
Some basic definitions about reduced decomposition:
In the symmetric group $S_n$, let $s_i$ denote the adjacent transposition $(i,i+1),i\in \{1,2,\cdots,n-1\}.$ Since $S_n$ is generated by adjacent ...
- 1,997
11
votes
2
answers
779
views
Characters of permutation groups
Let $N$ be a fixed positive integer, and denote by $C(m)$ the number of
permutations on an $N$-element set that have exactly $m$ cycles (counting
$1$-cycles). Then it is in the literature that the ...
- 4,679
9
votes
1
answer
356
views
Diameter of the modified bubble-sort graph
The modified bubble-sort graph is the Cayley graph $Cay(S_n,S)$ of $S_n$ generated by $n$ cyclically adjacent transpositions. Thus $S = \{ (1,2),(2,3),\ldots,(n,1)\}$. I was wondering whether the ...
- 406
16
votes
2
answers
818
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 $V^...
- 38.6k
6
votes
2
answers
998
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 $...
10
votes
5
answers
1k
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 $\...
- 101
14
votes
4
answers
778
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 ...
- 143
3
votes
0
answers
928
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 ...
29
votes
3
answers
4k
views
Roots of permutations
Consider the equation $x^2=x_0$ in the symmetric group $S_n$, where $x_0\in S_n$ is fixed. Is it true that for each integer $n\geq 0$, the maximal number of solutions (the number of square roots of $...
- 109k
14
votes
5
answers
2k
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 ...
- 1,010