Polarized Complexity-One T-Varieties
classification
🧮 math.AG
keywords
complexity-onet-varietiespolarizeddescribedivisorialaffinecombinatoriallycompare
read the original abstract
We describe polarized complexity-one T-varieties combinatorially in terms of so-called divisorial polytopes, and show how geometric properties of such a variety can be read off the corresponding divisorial polytope. We compare our description with other possible descriptions of polarized complexity-one T-varieties. We also describe how to explicitly find generators of affine complexity-one T-varieties.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.