Questions tagged [symmetric-groups]

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.

276 questions
Filter by
Sorted by
Tagged with
123 views

487 views

80 views

Do highly symmetric cones have “small” supporting hyperplanes?

Let $C$ be a full-dimensional cone in $\mathbb{R}^{d}$, defined as the positive span of $c = {n \choose 3} \gg d$ vectors. $C$ is highly symmetric in the following sense: each such vector is labelled ...
85 views

Smith normal form of conjugacy class actions

This question was inspired by Smith Normal Form of a Cayley Graph of the Symmetric Group. Let $\mathbb{Q}S_n$ denote the group algebra over $\mathbb{Q}$ of the symmetric group $S_n$. Identify a ...
486 views

Characteristic classes of symmetric group $S_4$

For the symmetric group $S_3$, it is classically known that \begin{equation} H^*(S_3;\mathbb{Z})\cong \mathbb{Z}[x,y]/(2x,6y,x^2-3y), \end{equation} where $|x|=2$ and $|y|=4$. Moreover, $x$ can be ...
236 views

Is there some sort of formula for $\tau(S_n)$?

Let $G$ be a finite group. Define $\tau(G)$ as the minimal number, such that $\forall X \subset G$ if $|X| > \tau(G)$, then $XXX = \langle X \rangle$. Is there some sort of formula for $\tau(S_n)$, ...
355 views

Probability of Words Summing to $1$ in $S_n$ or $PGL_2(n)$

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 abstract variables $x_1, x_2, \ldots,x_k$, i.e. $X$ is a product ...
118 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 ...
381 views

710 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 ...
195 views

Toggles for non-broken-circuit sets in matroids

Let $M$ be a matroid with ground set $E$. If $t$ is a total order on $E$, and if $S$ is a nonempty subset of $E$, then $\max_t S$ will mean the $t$-largest element of $S$ (that is, the maximum of $S$ ...
83 views

122 views

A symmetric function that appears in the coefficients of a power expansion

Let's say we have the expression $$\sum_{k_1=1}^\infty\sum_{k_2=1}^\infty\sum_{k_3=1}^\infty\sum_{k_4=1}^\infty\sum_{k_5=1}^\infty x^{k_1+k_2+k_3+k_4+k_5} f(k_1,k_2+k_3,k_4+k_5)$$ where $f(a,b,c)$ is ...
82 views

Has this result about the number of permutations of a given cycle type (or centralizers) been proved?

I was playing with the cardinality of conjugacy classes of the symmetric groups, which we know is the number of permutations of a given cycle type and there is a natural one-to-one correspondence ...
113 views

160 views

Cycle Structure of a Permutation Based on the Binary Representation

This is a question I posted on math.stackexchange.com before but never got an answer. I am cross-posting it here. Define a permutation $\sigma$ on the set $X=\{1,2,...,n\}$, $n$ is a natural number ...
Let $S_n$ be the symmetric group on $\{1,2,\ldots, n\}$ and $\ell$ the Coxeter length on $S_n$. There is a well-known formula to compute this length, namely for a $\pi \in S_n$ we have $$\ell(\pi) = |\... 1answer 458 views Character theoretic proof of the Littlewood–Richardson rule? The Littlewood–Richardson coefficients are the multiplicities$$ c(\lambda,\mu,\nu)= \dim_{\mathbb{C}}\operatorname{Hom}_{S_n}(S(\nu),S(\lambda/\mu)) $$and the Littlewood–Richardson rule says that ... 0answers 73 views Combinatorial model for twisted involutions in S_n Let (W,S) be a Coxeter group and *:S \to S be an automorphism of the Dynkin diagram of W so that *^2 is the identity. This induces a bijection *:W \to W mapping w = s_1 \dots s_n to w^* = ... 1answer 211 views Large subgroups of S_n without large symmetric or alternating subgroups I'm interested in determining the existence of a permutation group G\subseteq S_n of the following form. G is large. Meaning that G have at least n!/2^{o(n)} elements. Equivalently, their ... 0answers 90 views working with symmetric groups presented via nonstandard generators This is follow-up to my earlier question. Suppose that we have elements \sigma_1,\ldots,\sigma_k\in S_n, and that we established that these elements actually generate S_n. Since that previous ... 0answers 56 views A dimension formula for generalised symmetric powers of the natural module I need a reference for the following well-known statement - does anyone know one? Let \mu a partition of n into at most d parts. We let$${\rm Sym}^\mu(\Bbbk^d)={\rm Sym}^{\mu_1}(\Bbbk^d) \...
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$ ...