Polynomial Time Algorithms for Torus Actions

Levent Doğan (Technical University of Berlin)

13-Jan-2021, 15:00-16:00 (5 years ago)

Abstract: In this talk, we will consider three algorithmic problems, namely orbit equivalence, orbit closure intersection and orbit containment problem for actions of tori. We will describe the related invariant theory and show that all three problems admit polynomial time algorithms.

commutative algebraalgebraic geometrynumber theoryrepresentation theory

Audience: advanced learners


UCGEN - Uluslararası Cebirsel GEometri Neşesi

Series comments: Please register for the mailing list through which zoom details will be shared every week: docs.google.com/forms/d/e/1FAIpQLScNud4jzx8zlQgMm_3LglQBwfQANzqieZ0h9lv1wFUUkxxBjg/viewform?vc=0&c=0&w=1

For further information, please feel free to contact Turku Ozlum Celik.

Organizers: Alp Bassa, Türkü Özlüm Çelik*, Özgür Esentepe, Ali Özgür Kişisel
*contact for this listing

Export talk to