Fingerprint Invariant of Partitions and Construction
Abstract
The fingerprint invariant of partitions can be used to describe the Kazhdan-Lusztig map for the classical groups. We discuss the basic properties of fingerprint. We construct the fingerprints of rigid partitions in the Bn, Cn, and Dn theories. To calculate the fingerprint of a rigid semisimple operator (λ';λ"), we decompose λ'+λ" into several blocks. We define operators to calculate the fingerprint for each block using the results of fingerprint of the unipotent operators.
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.