Download this article
 Download this article For screen
For printing
Recent Issues

Volume 19
Issue 10, 1881–2090
Issue 9, 1671–1880
Issue 8, 1463–1670
Issue 7, 1259–1462
Issue 6, 1049–1258
Issue 5, 835–1048
Issue 4, 617–834
Issue 3, 415–616
Issue 2, 213–413
Issue 1, 1–211

Volume 18, 12 issues

Volume 17, 12 issues

Volume 16, 10 issues

Volume 15, 10 issues

Volume 14, 10 issues

Volume 13, 10 issues

Volume 12, 10 issues

Volume 11, 10 issues

Volume 10, 10 issues

Volume 9, 10 issues

Volume 8, 10 issues

Volume 7, 10 issues

Volume 6, 8 issues

Volume 5, 8 issues

Volume 4, 8 issues

Volume 3, 8 issues

Volume 2, 8 issues

Volume 1, 4 issues

The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Editors' interests
 
Subscriptions
 
ISSN 1944-7833 (online)
ISSN 1937-0652 (print)
 
Author index
To appear
 
Other MSP journals
Affine Deligne–Lusztig varieties via the double Bruhat graph, I: Semi-infinite orbits

Felix Schremmer

Vol. 19 (2025), No. 10, 1973–2014
Abstract

We introduce a new language to describe the geometry of affine Deligne–Lusztig varieties in affine flag varieties. This first part of a two-paper series develops the definition and fundamental properties of the double Bruhat graph by studying semi-infinite orbits. This double Bruhat graph was originally introduced by Naito and Watanabe to study periodic R-polynomials. We use it to describe the geometry of many affine Deligne–Lusztig varieties, overcoming a previously ubiquitous regularity condition.

Keywords
affine Weyl group, affine Deligne–Lusztig variety, double Bruhat graph, semi-infinite orbit, Shimura variety, Langlands program
Mathematical Subject Classification
Primary: 11G25, 20G25
Milestones
Received: 12 June 2023
Revised: 8 August 2024
Accepted: 18 October 2024
Published: 5 September 2025
Authors
Felix Schremmer
Department of Mathematics and New Cornerstone Laboratory
The University of Hong Kong
Hong Kong

Open Access made possible by participating institutions via Subscribe to Open.