3 problems

Structured discrete Hankel-transform conjecture. The following pairs are feasible:

Discrete square-size conjecture.

Discrete Fourier-transform feasibility conjecture. If $(k,q)$ is $s$-feasible, then $(k+1,q)$ and $(k,q-1)$ are $s$-feasible. The function $q\mapsto\mathbb{A}_s^{\textup{disc}}(q)$…