Computation of GIT quotients of semisimple groups

08/15/2023
by   Patricio Gallardo, et al.
0

We describe three algorithms to determine the stable, semistable, and torus-polystable loci of the GIT quotient of a projective variety by a reductive group. The algorithms are efficient when the group is semisimple. By using an implementation of our algorithms for simple groups, we provide several applications to the moduli theory of algebraic varieties, including the K-moduli of algebraic varieties, the moduli of algebraic curves and the Mukai models of the moduli space of curves for low genus. We also discuss a number of potential improvements and some natural open problems arising from this work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2018

Computing Unit Groups of Curves

The group of units modulo constants of an affine variety over an algebra...
research
11/30/2022

Algebraic-geometric codes with many automorphisms arising from Galois points

A method of constructing algebraic-geometric codes with many automorphis...
research
03/12/2020

Algorithms in Linear Algebraic Groups

This paper presents some algorithms in linear algebraic groups. These al...
research
10/06/2022

Computing groups of Hecke characters

We describe algorithms to represent and compute groups of Hecke characte...
research
02/01/2021

A Brief Account of Klein's Icosahedral Extensions

We present an alternative relatively easy way to understand and determin...
research
09/18/2018

Degree bound for toric envelope of a linear algebraic group

Algorithms working with linear algebraic groups often represent them via...
research
11/29/2022

Trustless unknown-order groups

Groups of unknown order are of major interest due to their applications ...

Please sign up or login with your details

Forgot password? Click here to reset