ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let π1,π2∈Irr⁡⟨ρ⟩\pi_1,\pi_2\in\operatorname{Irr}_{\langle \rho \rangle} be ladder representations, written as π1=L(mλ1,μ1e)\pi_1=L(\mathfrak{m}^e_{\lambda_1,\mu_1}) and π2=L(mλ2,μ2e)\pi_2=L(\mathfrak{m}^e_{\lambda_2,\mu_2}), with λ=λ1+λ2\lambda=\lambda_1+\lambda_2 and μ=μ1+μ2\mu=\mu_1+\mu_2. For w∈S(λ,μ)w\in S(\lambda,\mu), let σ=L(mλ,μw)\sigma=L(\mathfrak{m}^w_{\lambda,\mu}), let σ⊗\sigma_\otimes be its indicator representation, and let rασ(π1×π2)\mathbf{r}_{\alpha_\sigma}(\pi_1\times\pi_2) denote the corresponding Jacquet module. The multiplicity m(σ,π1×π2)m(\sigma,\pi_1\times\pi_2) is one if and only if

m(σ⊗,rασ(π1×π2))=1m(\sigma_\otimes,\mathbf{r}_{\alpha_\sigma}(\pi_1\times\pi_2))=1

and ww avoids the 321321 pattern.

This conjecture gives the proposed remaining rule for determining the irreducible factors of a product of two ladder representations. Multiplicity one is known for products of two ladder representations, and the permutation parameterization shows that all relevant candidates avoid 321321; the conjecture specifies exactly which candidates occur by combining pattern avoidance with the indicator multiplicity condition.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.