Minimax volume conjecture for Steenrod-square cup powers on rectangles

From papers

Let RR be an nn-dimensional rectangle with side lengths R1RnR_1\leq\cdots\leq R_n. Let VR\mathbb{V}_R denote the minimax volume, let a(k,R)a(k,R) be the relevant cup-power cohomology class, and let SqnlQSq_{n-l}^Q denote the indicated Steenrod-square operation with parameter QQ. For each integer k+1lnk+1\leq l\leq n, the conjecture is

Minimax volume conjecture. The minimax volume satisfies, up to a constant factor depending only on nn,

VR(SqnlQa(k,R))inf0jkR1Rj(Rj+1Rl)kjlj2lkljQ.\mathbb{V}_R\bigl(Sq_{n-l}^Q a(k,R)\bigr)\sim \inf_{0\leq j\leq k} R_1\cdots R_j\bigl(R_{j+1}\cdots R_l\bigr)^{\frac{k-j}{l-j}}2^{\frac{l-k}{l-j}Q}.

Such an estimate would provide lower bounds for the kk-dilation of degree-one maps between rectangles and, in particular, would imply the stated rectangular lower bound. The source presents this as a conjectural estimate; no resolution is given here.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Larry Guth, “Minimax problems related to cup powers and Steenrod squares”, arXiv:math/0702066 (2008).

Solutions 0

No solutions have been posted yet.