All Questions
Tagged with symmetric-groups permutations
53 questions
26
votes
6
answers
3k
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,219
30
votes
0
answers
814
views
Interpretation of "1089-number trick" in terms of symmetric group action on cohomology group?
I tried posting the following on math.stackexchange, but no answers. I can of course delete if inappropriate.
The "1089 number trick" (see e.g. here) says that if you take a three-digit ...
- 8,842
10
votes
1
answer
339
views
What is the Lie superalgebra generated by permutations?
Consider the group algebra of the symmetric group $\mathbb{C}S_n$. Then there is a corresponding Lie algebra $\mathfrak{L}(S_n)$ defined by
$$[\sigma, \tau] = \sigma\circ\tau - \tau\circ\sigma,$$
...
- 1,996
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 $...
- 63.9k
12
votes
1
answer
385
views
Question on a reduction in Kirillov's paper on positivity of divided difference operators
As the title says, my question is on a specific argument in Kirillov - Skew divided difference operators and Schubert polynomials (journal, MSN) on positivity of divided difference operators. I recall ...
- 2,168
7
votes
1
answer
591
views
Can Matsumoto's theorem for the symmetric group be proved using a monovariant?
This is a question that can be asked for any Coxeter group, but for the sake of simplicity I will restrict myself to symmetric groups. Recall the main definitions:
Let $n$ be a nonnegative integer. ...
- 11.2k
4
votes
1
answer
167
views
A probability problem in the conjugacy classes of symmetric group
Assume that $\sigma\in S_n$ has the cycle type $(p,.,p,1,..,1)$ where $p>2$ is a prime and the numbers of $1$ maybe $0$. If $\sigma_1$ and $\sigma_2$ are chosen uniformly in the conjugacy class of $...
- 9,720
2
votes
0
answers
99
views
Symmetric polynomial constructed from symmetric group
Let $n$ be a positive integer, $S_n$ be the symmetric group. For a permutation $p=[p_1,\dots,p_n]\in S_n$, define $x^p := x_1^{p_1}\cdots x_n^{p_n}$. It can be seen that the following polynomial is ...
- 34.3k
2
votes
1
answer
199
views
Sequence of monotone tuples and permutation condition for rotation
I was doing some counting in $S_n$ symmetric group I encountered the following problem, which also someway related to central factorial number.
So given a $n$ cycle say $(1,2,\ldots,n)$, what are the ...
- 34.3k
4
votes
1
answer
273
views
Relation between two permutation metrics
Note: I asked this question a few months ago here, but received no answer.
Consider the following two metrics on permutations of $\{1,2,\dots,n\}$:
$d_\text{swap}(\sigma,\tau)$ is the minimum number ...
- 3,093
3
votes
2
answers
252
views
Swaps in a permutation across an index
We are given two positive integers $N$ and $K$ such that $K < N$. We start with an array $A=[1,2,\dots,N]$. We can choose an arbitrary index $i \in \{1,2,\dots,N-1\}$ and we can swap $A[i]$ with $A[...
- 3,271
10
votes
1
answer
358
views
Induction step in Bóna and Ehrenborg's proof that the generating function of the alternating runs has -1 as a root of a certain multiplicity
This is a crosspost of a question I asked on Mathematics SE four months ago. Periodically bumping it and placing a bounty on it to attract more attention were to no avail. There are some comments ...
- 1,446
7
votes
0
answers
183
views
Explaining $\left(a-1\right)^n \cdot n! \mid a^{n-1} \prod_{i=1}^n \left(a^i-1\right)$ by a free $S_n$-action
Here is an olympiad-level problem on elementary number theory:
Let $a$ be an integer and $n$ a positive integer. Prove that
\begin{align}
\left(a-1\right)^n \cdot n! \mid a^{n-1} \prod_{i=1}^n \left(...
- 33.8k
3
votes
1
answer
275
views
Is the Cayley distance on permutation (matrices) equivalent to the Riemannian metric on $O(n)$?
Denote by $d_C(\sigma,\mu)$ the minimal number of transpositions needed to go from a permutation $\sigma$ to a permutation $\mu$. E.g. if $d_C(\sigma,\mu)=0$, then $\sigma=\mu$, if $d_C(\sigma,\mu)=1$,...
CommunityBot
- 1
10
votes
1
answer
274
views
When are immanants irreducible?
For a partition $\lambda$ let $\chi_\lambda$ be the corresponding irreducible representation of the symmetric group $S_n$.
Let $\mathrm{Imm}_\lambda(x) = \sum\limits_{\pi \in S_n} \chi_\lambda(\pi) x_{...
- 109k
0
votes
0
answers
56
views
Greatest common length of permutation
Given two permutations $\pi_1$ and $\pi_2$ without their cycle decompositions is there
a good method to compute the largest cycle length common between them in their decompositions?
a good method to ...
- 13.9k
4
votes
1
answer
139
views
A close reative of "Inflated" Eulerian polynomials
I came across this post Coefficients of the Inflated Eulerian Polynomial by AULI-GRAHAM-SAVAGE. In particular, the polynomials related to descents interested me
$$P_n(x)=\sum_{\pi\in\mathfrak{S}_n}x^{...
- 33.8k
7
votes
1
answer
344
views
For which $n$ can $S_n$ act transitively on $n+k$ elements?
It is known that the symmetric group $S_n$ can act transitively on $n+1$ elements if and only if $n=5$.
Are there similar classifications for $S_n$ acting transitively on $n+k$ elements, where $k$ is ...
- 2,217
8
votes
0
answers
331
views
A question related to Young symmetrizers
Let $T$ be an arbitrary Young tableau (i.e., filling of the diagram of an integer partition $\lambda$ of $n$ by the numbers from $1$ to $n$, each appearing once). Let $R(T)$ be the subgroup of ...
4
votes
0
answers
145
views
Words that give rise to an enumeration of elements of the symmetric group
Let $\mathbb{S}_m$ be the symmetric group on $m$ letters. Let $n=m-1$. Let $\mathbf{w}=a_1\cdots a_r$ be a word on the alphabet $\{1,\ldots,n\}$. We say that $\mathbf{w}$ gives rise to an enumeration ...
- 1,066
15
votes
5
answers
5k
views
How do most people write permutations?
I'd like to know how people prefer to write permutations, or elements of the symmetric group $S_n$ for $n\ge0$.
The most natural way to define a permutation in $S_n$ is as a bijection on the set $\{1,...
- 37.7k
1
vote
0
answers
177
views
Combinatorial bijection on monotone sequences
Let $(n),\mu$ be the partition of $n$ define $H_g^{m}((n);\mu)$ count's the number of tuples $(\tau_1,\ldots,\tau_r)$ of transposition in symmetric group $S_n$ with the following conditions
$$ (1,2,\...
- 685
2
votes
1
answer
140
views
Minimum local permutation data needed to globally merge locally sorted sequences?
We have $k$ blocks of integer sequences $B_1,\dots,B_k$ where $B_i$ is a sequence $$a_{i,1},\dots,a_{i,n_i}$$ with $a_{i,j}\leq a_{i,j+1}$.
Denote the permutation matrix $M_{\ell,\ell'}$ that merges $...
CommunityBot
- 1
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
12
votes
2
answers
947
views
How rare are unholey permutations?
For $S\subset [n]:=\{1,2,\dotsc,n\}$, define $\delta(S)$ to be the number of $m\in S$ such that $m+1\notin S$.
Given a permutation $\pi$ of $[n]$, we define the holeyness $D(\pi)$ of $\pi$ as being $...
- 20.2k
3
votes
2
answers
531
views
sum over permutations equals zero?
The question we are considering concerns a sum over all permutation $\sigma \in S_n$ (symmetric group) of a certain rational function:
$$\sum_{\sigma \in S_n} \frac{\sigma_{j1} \sigma_{j2}... \sigma_{...
- 35.5k
1
vote
0
answers
147
views
A certain kind of permutations and transport of Bruhat chains under conjugation
Let $(W,S)$ be a finite Coxeter system. Let us consider the following situation:
Let $v_1,v_2,w\in W$ such that $v_1=wv_2w^{-1}$. Let $s_{\beta_r}\ldots s_{\beta_1}$ be a reduced expression of $v_2$. ...
- 1,066
10
votes
2
answers
1k
views
A cancellation property for permutations?
Let $S_n$ be the group of $n$-permutations. Denote the number of inversions of $\sigma\in S_n$ by $\ell(\sigma)$.
QUESTION. Assume $n>2$. Does this cancellation property hold true?
$$\sum_{\...
- 24.9k
20
votes
4
answers
2k
views
An $n!\times n!$ determinant
Let us consider the matrix $A$ with its rows and columns enumerated by the elements of $S_n$ with $A_{\sigma\tau}=x^{c(\sigma\tau^{-1})}$ where $c()$ is the number of cycles in a permutation's ...
- 35.5k
1
vote
1
answer
136
views
The number of permutations with a special condition
Suppose we are considering $S_n$. For any permutation, let $h$ be the number of derangement and $N$ be the number of cycles with length no less than 2.
I'm interested in the number of permutations ...
- 34.3k
1
vote
3
answers
2k
views
The number of permutations with specified number of cycles and fixed points
I'm interested in the number of permutations for a specified number of fixed points and cycles.
Suppose we are in $S_n$. For any permutation in $S_n$, let $h$ be the number of changed points (the ...
- 34.3k
13
votes
2
answers
841
views
Cycle generating function of permutations with only odd cycles
Let $\mathrm{ODD}(n)$ be the set of permutations in $\mathfrak{S}_n$ whose cycle lengths are all odd. It is known that
$$ \#\mathrm{ODD}(n) = \begin{cases} ((n-1)!!)^2 &\textrm{ if $n$ is even}; \\...
- 85.6k
3
votes
1
answer
258
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 ...
- 588
2
votes
0
answers
85
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^* = ...
- 1,989
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
2
votes
0
answers
81
views
Characterization of permutations which have at most one successor in the covering relation of the weak Bruhat order
Let $W$ be the symmetric group on $n+1$ letters. Let $\ell$ be the length function on $W$.
As the title says, can we characterize all $v\in W$ such that there exists a $w\in W$ such that for all ...
- 1,066
6
votes
2
answers
366
views
Provoking involutions further
Let $\mathfrak{S}_n$ denote the permutation group, and $I_0(n)=\sum_{j\geq0}\binom{n}{2j}\frac{(2j)!}{2^jj!}$ stand for involutions see A000085 for more interpretations. There is also these numbers $...
- 5,654
3
votes
2
answers
216
views
trace and involution permutations: Part II
This is a follow up on my earlier MO question.
Let $\operatorname{Inv}(\mathfrak{S}_n):=\{\pi\in\mathfrak{S}_n: \pi^2=1\}$ be the set of involutions in the symmetric group $\mathfrak{S}_n$. Denote $...
CommunityBot
- 1
13
votes
1
answer
637
views
trace and involution permutations: Part I
Let $\operatorname{Inv}(\mathfrak{S}_n):=\{\pi\in\mathfrak{S}_n: \pi^2=1\}$ be the set of involutions in the symmetric group $\mathfrak{S}_n$. Denote $I_n:=\#\operatorname{Inv}(\mathfrak{S}_n)$. Let $\...
- 43.2k
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 $\...
- 34.3k
8
votes
1
answer
200
views
factorization of polynomials wrt the major index stat
Let $\mathfrak{S}_n$ be the permutation group on $\{1,\dots,n\}$. Given $\pi=\pi_1\pi_2\dots\pi_n\in\mathfrak{S}_n$, its major index statistic is denoted maj$(\pi)$. Define the polynomials
$$Q_{n,k}(x)...
- 33.8k
4
votes
3
answers
947
views
Maximal pairwise distance between $k$ permutations
How can k permutations on n-set be arranged to maximize minimal pairwise Kendall tau distance (i.e. number of discordant pairs) between them?
For two permutations this is obviously when the second ...
6
votes
2
answers
532
views
A question about (unicity of certain cycles in a Cayley graph of a) symmetric group
Let $S=\{(1,2),(1,2,3,\ldots,n),(1,2,3,\ldots,n)^{-1}=(1,n\ldots,2)\}$ be a subset of the symmetric group $S_n$. We know that $(1,2,\ldots,n)(1,2)=(2,3,\ldots,n)$, and thus $$[(1,2,\ldots,n)(1,2)]^{n-...
- 13k
4
votes
1
answer
419
views
On the symmetric group of 2^n elements
Consider the set $ X_1^n=\{1,2,...,2^n\} $. Then define $ X_2^n $ to be the set of two element subsets of $ X_1^n $. I will construct $ X_i $ by induction on $ i $. $ X_i^n $ is the set of two element ...
- 5,654
0
votes
0
answers
62
views
normal sets and conjugate generating sets of $S_n$
In this arXiv paper (p. 13), Steinhardt defines a normal set in $S_n$ as follows:
Definition: A split set of more than two cycles generating $S_n$ is said to be normal if any element is adjacent to ...
- 146
4
votes
0
answers
1k
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 ...
- 121
3
votes
0
answers
156
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 $\lim_{n\rightarrow\...
- 4,952
3
votes
0
answers
75
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 $\pi^{-1}=\sigma=...
- 61
4
votes
0
answers
97
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 ...
- 4,952
3
votes
1
answer
365
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 ...
- 34.3k