Rationality problem for algebraic tori
Akinari Hoshi, Aiichi Yamasaki

TL;DR
This paper classifies algebraic tori of dimensions 4 and 5 regarding their stable rationality, providing explicit counts and developing computational methods to analyze their lattice structures and rationality properties.
Contribution
It offers a complete classification of stably rational algebraic tori in dimensions 4 and 5, introduces algorithms for lattice analysis, and explores the structure of G-lattices and their rationality.
Findings
Exactly 487 stably rational tori of dimension 4
3051 stably rational tori of dimension 5
Algorithms for computing flabby resolutions of G-lattices
Abstract
We give the complete stably rational classification of algebraic tori of dimensions and over a field . In particular, the stably rational classification of norm one tori whose Chevalley modules are of rank and is given. We show that there exist exactly (resp. , resp. ) stably rational (resp. not stably but retract rational, resp. not retract rational) algebraic tori of dimension , and there exist exactly (resp. , resp. ) stably rational (resp. not stably but retract rational, resp. not retract rational) algebraic tori of dimension . We make a procedure to compute a flabby resolution of a -lattice effectively by using the computer algebra system GAP. Some algorithms may determine whether the flabby class of a -lattice is invertible (resp. zero) or not. Using the algorithms, we determine all the flabby and coflabby -lattices…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Geometric and Algebraic Topology · Advanced Combinatorial Mathematics
