English

Fingerprint Invariant of Partitions and Construction

Combinatorics 2017-11-10 v1

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 BnB_n, CnC_n, and DnD_n theories. To calculate the fingerprint of a rigid semisimple operator (λ;λ")(\lambda^{'};\lambda^{"}), we decompose λ+λ"\lambda^{'}+\lambda^{"} into several blocks. We define operators to calculate the fingerprint for each block using the results of fingerprint of the unipotent operators.

Keywords

Cite

@article{arxiv.1711.03443,
  title  = {Fingerprint Invariant of Partitions and Construction},
  author = {Bao Shou and Qiao Wu},
  journal= {arXiv preprint arXiv:1711.03443},
  year   = {2017}
}

Comments

23 pages,30 figures