Construction of Tame Types

TL;DR

This paper develops a method to construct tame types for connected reductive p-adic groups, exploring their completeness and equivalence to better understand their structure.

Contribution

It introduces a new construction of tame types and analyzes their exhaustion and equivalence properties in the context of p-adic groups.

Findings

Successfully constructed tame types for connected reductive p-adic groups

Established criteria for exhaustion and equivalence of these types

Enhanced understanding of the structure of p-adic group representations

Abstract

We construct tame types for connected reductive p-adic groups. We also discuss their exhaustion and equivalence.