# Questions tagged [permutations]

Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.

367 questions
Filter by
Sorted by
Tagged with
47 views

### Conjugacy classes in reductive group under adjoint action of parabolic subgroup

Given a reductive group $G$ over a finite field and a parabolic subgroup $P$ , I wonder what are the orbits in $G$ under the adjoint action of $P$. This should be standard, but I can only find results ...
56 views

36 views

### How to take into account the properties of $M(n)$ numbers and improve the variance of normal distribution?

It is known the normal approximation to $inv(\pi)$: $$\left| P\left( \frac{\mathrm{inv}(\pi)-\frac 12{n\choose 2}}{\sqrt{n(n-1)(2n+5)/72}}\leq x\right)-\Phi(x)\right| \leq \frac{C}{\sqrt{n}},$$ ...
9 views

367 views

### On a statistic for permutations

Given a permutation $\pi$ we can write $\pi=s_{i_1} ... s_{i_l}$ as a product of simple transpositions $s_i=(i,i+1)$ in a minimal way. Question 1: Is there an "official" name for the permutation ...
1k views

264 views

### How many steps on $S_n$ are required to span $V\wedge V$, $V = K^n$?

Let $A$ be a set of generators of $G=S_n$; assume $e\in A$, $A=A^{-1}$. Let $V = K^n$, $K$ a field. Consider the natural action of $G$ on $V$ (namely, $g(e_i) = e_{g(i)}$) and on $W = V\wedge V$ (...
228 views

### How many steps are required for double transitivity?

Let $A$ be a set of generators of $S_n$, or of a doubly transitive subgroup of $S_n$. Assume $e\in A$, $A=A^{-1}$. What is the least $k$ such that $A^k$ is doubly transitive as a set? That is, what is ...
90 views

### Calculating the values of a generalization of binomials to permutations

let $$\Pi\binom{n}{k}:=\mathrm{card}\left( \left\lbrace \lbrace \Pi_1^n\,\cdots\,\Pi_k^n\rbrace\,|\,0\leq \pi_{r,c}\in\sum_{i=1}^k\Pi_i^n\ni\pi_{r,c}\leq 1\right\rbrace\right)$$ be the number of sets ...
60 views

### The notions of “monomial” and “induced monomial” in representation theory

Let $G$ be a group and let $\rho : G \rightarrow V$ over a finite-dimensional vector space. A matrix $M \in \mathbb C^{ k \times k }$ is monomial if every row and every of column of that matrix has ...
111 views

383 views

### Classification of shod Dyck paths

A sequence $[c_0,c_1,...,c_{n-1}]$ with $n \geq 2$ is called a Dyck path in case $c_{n-1}=1$, $c_i \geq 2$ for $i \neq n-1$ and $c_i-1 \leq c_{i+1}$ for each $i$. For example the Dyck paths for $n=4$ ...
2k views

### Number of solutions and minimal clues in Sixy Sudoku

Sixy Sudoku is a variation on Latin squares and traditional sudoku played on a $6 \times 6$ grid with an initial clue of several cells filled in with a subset of the digits $1$–$6$. The task is to ...
287 views

### Enumerating all permutations that are “square roots” of derangements

Is there an algorithm that enumerates all permutations that are "square roots" of derangements, i.e. permutations that, when applied twice, yield a derangement? Other information about those kind ...
893 views

181 views

20 views

### Do small subsets of $S_n$ subgroups cover almost all permutation configurations of $S_n$?

Given integer $m\in[1,n]$ fix a set $\mathcal T$ of permutations in $S_n$. Then there are subgroups $G_1,\dots,G_m$ of $S_n$ so that $\mathcal T$ is covered by cosets of $G_1,\dots,G_m$. For ...
### Are almost all permutation configurations from $S_n$ covered by small subsets subgroups of $S_n$?
Given integer $m\in[1,n]$ fix a set $\mathcal T$ of permutations in $S_n$. Then there are subgroups $G_1,\dots,G_m$ of $S_n$ so that $\mathcal T$ is covered by cosets of $G_1,\dots,G_m$. Do we ...
### Multiplication in $Z(\mathbb{C}S_n)$ [duplicate]
I am trying to multiply two generators of center $Z(\mathbb{C}[S_n])$ of ring algebra of symmetric group of $n$ elements. We know that these generators are given by sums of conjugacy classes in $S_n,$ ...