2000 character limit reached
T-Duality for Langlands Dual Groups (1211.0763v2)
Published 5 Nov 2012 in math.DG
Abstract: This article addresses the question of whether Langlands duality for complex reductive Lie groups may be implemented by T-dualization. We prove that for reductive groups whose simple factors are of Dynkin type A, D, or E, the answer is yes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.