Aubert duality and co-tempered data
Abstract
Let be a non-archimedean local field of characteristic 0, and let be either or . We introduce a new algorithm to compute the Aubert dual at the level of Langlands data. This algorithm acts as the dual to the recent Lanard-M\'inguez algorithm. It fundamentally differs in two ways: it follows a bottom-up approach rather than a top-down one, and its internal computations strictly preserve the temperedness of the representations. Consequently, this approach naturally yields a new constructive characterization of co-tempered representations. By operating exclusively within the realm of tempered data, this algorithm enables inductive proofs of new properties for co-tempered representations. In particular, we provide a precise description of their tempered components and establish an explicit duality formula for a large class of tempered representations.
Cite
@article{arxiv.2607.07512,
title = {Aubert duality and co-tempered data},
author = {Nans Bonnel},
journal= {arXiv preprint arXiv:2607.07512},
year = {2026}
}
Comments
53 pages, comments are welcome