WPC on free matroids
In the free-matroid case, for every partition , admits a Latin tableau if and only if is wide.
References
- Counting and constructing Latin tableaux — arXiv — Spencer Daugherty, Michaela Fahnesock, Shawn Huxtable, Michael Larson, Nourah Al Munayes, Storey Peacock
Source: arXiv
Progress summary
A new paper expands the known positive cases and finds useful monotonicity, but the general conjecture remains open.
The wide-partition conjecture asks whether a partition is Latin exactly when it is wide, in the free-matroid case. The 2003 foundational paper established substantial special cases and explicitly left the general characterization open.
Known results
- The conjecture holds for partitions with at most two distinct part sizes, with further cases for three or four sizes.
- It holds for self-conjugate partitions with at most three distinct part sizes.
- It was computationally verified for partitions with at most 65 cells and for diagrams inside a 10 by 10 square.
- A later Latin-tableau result proves the first four type parts in the general setting, while the full conjecture remains open.
October 2026 constructions and monotonicity
Spencer Daugherty, Michaela Fahnesock, Shawn Huxtable, Michael Larson, Nourah Al Munayes, and Storey Peacock report new classes of wide partitions admitting Latin tableaux and prove tableau-count monotonicity under specified operations. This is progress toward the characterization, not a proof of the general if-and-only-if statement, and is unverified here.
Current status (as of October 2026): The general wide-if-and-only-if characterization remains open; new classes and monotonicity results are claimed but do not settle it.
Solutions 0
No solutions have been posted yet.