2000 character limit reached
Orbit and Orbit Closure Containments for Cubic Surfaces
Published 21 Jun 2020 in math.AG | (2006.11688v1)
Abstract: Given two elements of a vector space acted on by a reductive group, we ask whether they lie in the same orbit, and if not, whether one lies in the orbit closure of the other. We develop techniques to optimize the orbit and orbit closure algorithms and apply these to give a partial classification of orbit closure containments in the case of cubic surfaces with infinitely many singular points, which are known to fall into 13 normal forms. We also discuss the computational obstructions to completing this classification, and discuss tools for future work in this direction.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.