ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt, nn, and mm be positive integers, let XX be an m×tm\times t matrix of variables and YY a t×nt\times n matrix of variables, and let R\mathcal{R} be the Reynolds operator for the standard dual action of GL⁡t(k)\operatorname{GL}_t(k) on k[X,Y]k[X,Y]. Write [XY]1,1[XY]_{1,1} for the (1,1)(1,1) entry of the matrix product XYXY.

General linear Reynolds formula. For t=2t=2 and n≥0n\geq 0, one has

R((x11y11)n)=1n+1(x11y11+x12y21)n=1n+1([XY]1,1)n.\mathcal{R}\left((x_{11}y_{11})^n\right)=\frac{1}{n+1}(x_{11}y_{11}+x_{12}y_{21})^n=\frac{1}{n+1}\left([XY]_{1,1}\right)^n.

More generally, for t≥1t\geq1 and n≥0n\geq0, one has

R((x11y11)n)=(n+t−1t−1)−1([XY]1,1)n.\mathcal{R}\left((x_{11}y_{11})^n\right)=\binom{n+t-1}{t-1}^{-1}\left([XY]_{1,1}\right)^n.

The formula is motivated by experimentation with the package IntU and is stated as a conjectural generalization of the t=2t=2 computation. No resolution is supplied in the given text.

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.