Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Resolution of Reductive Monoids and Multiplicativity of $γ$-factors

Published 25 Jun 2021 in math.NT and math.RT | (2106.13399v3)

Abstract: In this article, we give a proof of multiplicativity for $\gamma$-factors, an equality of parabolically induced and inducing factors, in the context of the Braverman-Kazhdan/Ngo program, under the assumption of commutativity of the corresponding Fourier transforms and a certain generalized Harish-Chandra transform. We also discuss the resolution of singularities and their rationality for reductive monoids, which are among the basic objects in the program.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.