All Questions
Tagged with symmetric-groups permutations
18 questions with no upvoted or accepted answers
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 ...
- 301
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 ...
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
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
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
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
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
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
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
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
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
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
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
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
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