skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Harmonic analysis on certain spherical varieties
Braverman and Kazhdan proposed a conjecture, later refined by Ngô and broadened to the framework of spherical varieties by Sakellaridis, that asserts that affine spherical varieties admit Schwartz spaces, Fourier transforms, and Poisson summation formulae. The first author in joint work with B. Liu and later the first two authors proved these conjectures for certain spherical varieties Y built out of triples of quadratic spaces. However, in these works the Fourier transform was only proven to exist. In the present paper we give, for the first time, an explicit formula for the Fourier transform on Y: We also prove that it is unitary in the nonarchimedean case. As preparation for this result, we give explicit formulae for Fourier transforms on the affine closures of Braverman–Kazhdan spaces attached to maximal parabolic subgroups of split, simple, simply connected groups. These Fourier transforms are of independent interest, for example, from the point of view of analytic number theory.  more » « less
Award ID(s):
2231514 2200852
PAR ID:
10533145
Author(s) / Creator(s):
; ;
Publisher / Repository:
Journal of the European Mathematical Society
Date Published:
Journal Name:
Journal of the European Mathematical Society
ISSN:
1435-9855
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. In this article we prove a conjecture of Braverman-Kazhdan in [BK1] on acyclicity of ρ-Bessel sheaves on reductive groups. We do so by proving a vanishing conjecture proposed in our previous work [C]. As a corollary, we obtain a geometric construction of the non-linear Fourier kernel for a finite reductive group as conjectured by Braverman and Kazhdan. The proof uses the theory of Mellin transforms, Drinfeld center of Harish-Chandra bimodules, and a construction of a class of character sheaves in mixed-characteristic. 
    more » « less
  2. Let X X be an affine spherical variety, possibly singular, and L + X \mathsf L^+X its arc space. The intersection complex of L + X \mathsf L^+X , or rather of its finite-dimensional formal models, is conjectured to be related to special values of local unramified L L -functions. Such relationships were previously established in Braverman–Finkelberg–Gaitsgory–Mirković for the affine closure of the quotient of a reductive group by the unipotent radical of a parabolic, and in Bouthier–Ngô–Sakellaridis for toric varieties and L L -monoids. In this paper, we compute this intersection complex for the large class of those spherical G G -varieties whose dual group is equal to G ˇ \check G , and the stalks of its nearby cycles on the horospherical degeneration of X X . We formulate the answer in terms of a Kashiwara crystal, which conjecturally corresponds to a finite-dimensional G ˇ \check G -representation determined by the set of B B -invariant valuations on X X . We prove the latter conjecture in many cases. Under the sheaf–function dictionary, our calculations give a formula for the Plancherel density of the IC function of L + X \mathsf L^+X as a ratio of local L L -values for a large class of spherical varieties. 
    more » « less
  3. Abstract We give explicit presentations of the integral equivariant cohomology of the affine Grassmannians and flag varieties in type A, arising from their natural embeddings in the corresponding infinite (Sato) Grassmannian and flag variety. These presentations are compared with results obtained by Lam and Shimozono, for rational equivariant cohomology of the affine Grassmannian, and by Larson, for the integral cohomology of the moduli stack of vector bundles on. 
    more » « less
  4. Abstract We give a simple and uniform proof of a conjecture of Haines–Richarz characterizing the smooth locus of Schubert varieties in twisted affine Grassmannians. Our method is elementary and avoids any representation theoretic techniques, instead relying on a combinatorial analysis of tangent spaces of Schubert varieties. 
    more » « less
  5. null (Ed.)
    In this paper we consider the following sparse recovery problem. We have query access to a vector 𝐱 ∈ ℝ^N such that x̂ = 𝐅 𝐱 is k-sparse (or nearly k-sparse) for some orthogonal transform 𝐅. The goal is to output an approximation (in an 𝓁₂ sense) to x̂ in sublinear time. This problem has been well-studied in the special case that 𝐅 is the Discrete Fourier Transform (DFT), and a long line of work has resulted in sparse Fast Fourier Transforms that run in time O(k ⋅ polylog N). However, for transforms 𝐅 other than the DFT (or closely related transforms like the Discrete Cosine Transform), the question is much less settled. In this paper we give sublinear-time algorithms - running in time poly(k log(N)) - for solving the sparse recovery problem for orthogonal transforms 𝐅 that arise from orthogonal polynomials. More precisely, our algorithm works for any 𝐅 that is an orthogonal polynomial transform derived from Jacobi polynomials. The Jacobi polynomials are a large class of classical orthogonal polynomials (and include Chebyshev and Legendre polynomials as special cases), and show up extensively in applications like numerical analysis and signal processing. One caveat of our work is that we require an assumption on the sparsity structure of the sparse vector, although we note that vectors with random support have this property with high probability. Our approach is to give a very general reduction from the k-sparse sparse recovery problem to the 1-sparse sparse recovery problem that holds for any flat orthogonal polynomial transform; then we solve this one-sparse recovery problem for transforms derived from Jacobi polynomials. Frequently, sparse FFT algorithms are described as implementing such a reduction; however, the technical details of such works are quite specific to the Fourier transform and moreover the actual implementations of these algorithms do not use the 1-sparse algorithm as a black box. In this work we give a reduction that works for a broad class of orthogonal polynomial families, and which uses any 1-sparse recovery algorithm as a black box. 
    more » « less