4 problems
- 0 votes0 replies0 views
The complete type-edge-pair description of the solution set for
Complete type-edge-pair conjecture. The union over all type-edge pairs equals the solution set:
- 0 votes0 replies0 views
The type-edge-pair computation conjecture for affine Deligne–Lusztig sets in
Type-edge-pair computation conjecture. The folding of gives the entire computed superset .
- 0 votes0 replies1 view
Completeness of the computed supersets for affine Deligne–Lusztig solution sets in
Completeness conjecture. The computed supersets are complete; equivalently, the chambers produced by the relevant type-edge pairs give the entire superset .
- 0 votes0 replies0 views
Nonemptiness and parahoric surjectivity conjecture for affine Deligne–Lusztig sets
Let be the reductive group over considered above, let be the corresponding extension with Frobenius , let be a conjugacy class of minuscule one-parameter…