First-hand information for everyone
A new study shows that a special family of maximally–dimensional, positively folded alcove walks parametrises the top–dimensional pieces of a parabolic Mirković–Vilonen (MV) intersection. In other words, these walks label the MV cycles of a given coweight pair. Mapping is explicit: start with a minimal walk in the standard apartment and fold until final alcove contains a vertex of dual weight. This construction yields a direct route from a purely combinatorial object to the geometric building blocks of the MV intersection.
The crystal structure familiar from representation theory is transferred to these walks via the skeleton bijection. By taking the skeleton of a walk one obtains a Gaussent–Littelmann Littelmann–Saks (LS) gallery, and the Kashiwara root operators act naturally on both sides. This mirrors the usual crystal operations on LS galleries, confirming that the walk model is faithful to the underlying representation theory.
An immediate consequence is a combinatorial description of Levi branching multiplicities. The number of LS galleries whose last vertex is a prescribed weight equals the multiplicity of an irreducible representation of the larger group when restricted to a Levi subgroup. Equivalently, the same number counts the maximal‐dimensional walks in the alcove model. Thus a perfectly concrete counting problem replaces a classical branching calculation.
However, the bijection between walks and LS galleries works only for the maximal‑dimensional family. For other positively folded walks the skeleton can be the same while the dimension differs, so the correspondence breaks down. This limitation appears already for groups of type $B_2$, such as $G= ext{SO}_5$, where two distinct lifts of the same LS gallery exist—one maximal‑dimensional and one not—showing that the bijection cannot be extended to the whole set of positively folded walks.
Overall, the work provides a clean combinatorial language to study MV cycles and Levi branching, while clearly delineating the scope and limits of the mapping.