Theta-Lift Calculator

 Local computation

This program computes all theta-lift paths that give a special unipotent representation of G = SO(n,n+1) with lowest harmonics equal to a fine K-type. For each path, the program also computes its painted bipartition and associated cycle.

References:

The painted-bipartition algorithms is built on Jia-Jun Ma’s unipotentrepn GitHub repository.

D. Barbasch, J.-J. Ma, B. Sun, and C.-B. Zhu, Special unipotent representations of real classical groups: counting and reduction.

D. Barbasch, J.-J. Ma, B. Sun, and C.-B. Zhu, Special unipotent representations of real classical groups: construction and unitarity.

Use decreasing even rows: 6,4,2,2,2 or the compact notation 64222. Use commas when a row has two digits.

Try an example