On the computability of some positive-depth supercuspidal characters near the identity

Abstract

This paper is concerned with the values of Harish-Chandra characters of a class of positive-depth, toral, very supercuspidal representations of p-adic symplectic and special orthogonal groups, near the identity element. We declare two representations equivalent if their characters coincide on a specific neighbourhood of the identity (which is larger than the neighbourhood on which Harish-Chandra local character expansion holds). We construct a parameter space B (that depends on the group and a real number r>0) for the set of equivalence classes of the representations of minimal depth r satisfying some additional assumptions. This parameter space is essentially a geometric object defined over . Given a non-Archimedean local field with sufficiently large residual characteristic, the part of the character table near the identity element for G() that comes from our class of representations is parameterized by the residue-field points of B. The character values themselves can be recovered by specialization from a constructible motivic exponential function. The values of such functions are algorithmically computable. It is in this sense that we show that a large part of the character table of the group G() is computable.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…