Alcove Walk Models for Parabolic Mirković-Vilonen Intersections and Branching to Levi Subgroups

Abstract This article proves an alcove walk description of intersections of Schubert cells and partially semi-infinite orbits (depending on a choice of parabolic subgroup) in the affine Grassmannian of a split connected reductive group (we call these intersections parabolic Mirković-Vilonen intersections ). We deduce from this a parameterization of the irreducible components of the maximal possible dimension in these intersections by the alcove walks of maximal possible dimension. As a consequence we present a new combinatorial description of branching to Levi subgroups of irreducible highest weight representations, and in particular, we give a new algorithm for computing the characters of such representations.

Authors

Institutions

Publication Details

Journal
Transformation Groups
Published
2026-05-19
DOI
https://doi.org/10.1007/s00031-026-09956-0
Primary Topic
Mathematical Dynamics and Fractals
Type
preprint
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Alcove Walk Models for Parabolic Mirković-Vilonen Intersections and Branching to Levi Subgroups

Thomas J. Haines
Transformation Groups
Mathematical Dynamics and Fractals
preprint

Alcove Walk Models for Parabolic Mirković-Vilonen Intersections and Branching to Levi Subgroups

Thomas J. Haines
preprint en

Abstract

Abstract This article proves an alcove walk description of intersections of Schubert cells and partially semi-infinite orbits (depending on a choice of parabolic subgroup) in the affine Grassmannian of a split connected reductive group (we call these intersections parabolic Mirković-Vilonen intersections ). We deduce from this a parameterization of the irreducible components of the maximal possible dimension in these intersections by the alcove walks of maximal possible dimension. As a consequence we present a new combinatorial description of branching to Levi subgroups of irreducible highest weight representations, and in particular, we give a new algorithm for computing the characters of such representations.

Transformation Groups
University of Maryland, College Park (US)
National Science Foundation
Openalex Percentile: Top 97%
Mathematical Dynamics and Fractals
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.