Dominance monotonicity conjecture for unipotent tensor squares
Dominance monotonicity conjecture for unipotent tensor squares
Let be a positive integer, let and be partitions of , and let be a partition of . Write
For partitions of , let mean that is below in dominance order. Dominance monotonicity conjecture. If for every partition of , then for every partition of and every partition . This is presented as a consequence of the first part of the preceding conjecture, since dominance below a partition with first part at most preserves that bound. It therefore remains conjectural in the paper.
Sources & referencesView supporting material
Primary source
Emmanuel Letellier and GyeongHyeon Nam, “Saxl conjecture and the tensor square of unipotent characters of GL(n,q)”, arXiv:2312.09157 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.