I am reading the paper (arXiv:1605.08545v5). There is a notation $S_{\lambda} w S_{\mu}$ on page 61 before the formula (27). It is said that $w$ is of maximal length in $S_{\lambda} w S_{\mu}$. Here $\lambda, \mu \in \mathbb{Z}^k$ are $\lambda = (\lambda_1, \lambda_2, \ldots, \lambda_k)$, $\lambda_1 \ge \cdots \ge \lambda_k$, $\mu = (\mu_1, \mu_2, \ldots, \mu_k)$, $\mu_1 \ge \cdots \ge \mu_k$. What are $S_{\lambda}$ and $S_{\lambda} w S_{\mu}$? How to compute maximal $w$ for given $\lambda, \mu$? Thank you very much.
2026-03-26 12:42:31.1774528951
Trying to understand a notation $S_{\lambda} w S_{\mu}$.
54 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in REPRESENTATION-THEORY
- How does $\operatorname{Ind}^G_H$ behave with respect to $\bigoplus$?
- Minimal dimension needed for linearization of group action
- How do you prove that category of representations of $G_m$ is equivalent to the category of finite dimensional graded vector spaces?
- Assuming unitarity of arbitrary representations in proof of Schur's lemma
- Are representation isomorphisms of permutation representations necessarily permutation matrices?
- idempotent in quiver theory
- Help with a definition in Serre's Linear Representations of Finite Groups
- Are there special advantages in this representation of sl2?
- Properties of symmetric and alternating characters
- Representation theory of $S_3$
Related Questions in SYMMETRIC-GROUPS
- Orbit counting lemma hexagon
- A "Restricted Sudoku" Symmetry Group Question
- Show, by means of an example, that the group of symmetries of a subset X of a Euclidean space is, in general, smaller than Sym(x).
- Prove that $\sigma$ is a power of $\tau$ when they commute $\sigma\tau=\tau\sigma$.
- Proof verification - the only group of order 24 without normal sylow subgroup is $S_4$.
- Symmetry subgroup of a cube
- Subgroup generated by $S$ is $A_5$
- Question about semigroups of permutations
- Symmetry of the tetrahedron as a subgroup of the cube
- Interpretation of wreath products in general and on symmetric groups
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
On page 60, the authors say that if $\mu = \left(\mu_1, \mu_2, \ldots, \mu_k\right) \in \mathbb{Z}^k$ is any $k$-tuple, then $S_\mu$ denotes the stabilizer of the $k$-tuple $\mu$ in $S_k$. Presumably, the action of $S_k$ on the $k$-tuples being used here is the one that permutes the coordinates. Thus, $S_\mu$ is the set of all permutations $\sigma \in S_k$ such that all $i \in \left\{1,2,\ldots,k\right\}$ satisfy $\mu_{\sigma\left(i\right)} = \mu_i$.
This stabilizer $S_\mu$ can be characterized as the subgroup of $S_k$ consisting of all permutations that preserve a certain set partition (i.e., preserve each part of the set partition) of $\left\{1,2,\ldots,k\right\}$. If $\mu_1 \geq \mu_2 \geq \cdots \geq \mu_k$, then this set partition is an interval partition (= set partition into intervals). Thus, in this case, $S_\mu$ is what is called a Young subgroup.
So you know that $S_\lambda$ and $S_\mu$ are Young subgroups in the case that you care about. Now, $S_\lambda w S_\mu$ hopefully means the double coset $\left\{x w y \mid x \in S_\lambda,\ y \in S_\mu\right\} \subseteq S_k$. These double cosets are fairly familiar objects -- see Mark Wildon's A model for the double cosets of Young subgroups. Note, however, that the definition of $S_\nu$ in Wildon's note is not literally equivalent to your definition of $S_\mu$ above -- more precisely, it is equivalent but not for $\mu = \nu$. To be more explicit: If $\nu = \left(\nu_1, \nu_2, \nu_3, \ldots\right)$ is a partition of $k$, then Wildon's $S_\nu$ is your $S_\mu$, where \begin{align} \mu = \left( \underbrace{-1,-1,\ldots,-1}_{\nu_1 \text{ times}}, \underbrace{-2,-2,\ldots,-2}_{\nu_2 \text{ times}}, \underbrace{-3,-3,\ldots,-3}_{\nu_3 \text{ times}}, \ldots\right) \in \mathbb{Z}^k . \end{align} You can easily check that, conversely, any $S_\mu$ in your sense can be rewritten as an $S_\nu$ in Wildon's sense for an appropriately chosen partition $\nu$ of $k$.
Also, keep in mind that Mark Wildon is British and writes composition of maps the "other" way round -- so the product $ab$ of two permutations $a,b\in S_k$ in Wildon's note will mean "apply $a$ first and $b$ second". Though I don't know whether the article you are reading doesn't do that as well.
I hope that was a reasonable Rosetta stone.