Abstract
Tate algebras, introduced in [Tate, 1971], are fundamental objects in the
context of analytic geometry over the p-adics. Roughly speaking,
they play the same role as polynomial algebras play in classical
algebraic geometry. In the present article, we develop the formalism
of Gröbner bases for Tate algebras. We prove an analogue of the
Buchberger criterion in our framework and design a Buchberger-like and a F4-like algorithm for computing Gröbner bases over Tate
algebras. An implementation in SageMath is also discussed.
Original language | English |
---|---|
Title of host publication | ISSAC '19: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation |
Pages | 74-81 |
Number of pages | 8 |
DOIs | |
Publication status | Published - Jul 2019 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101013 Mathematical logic
- 102031 Theoretical computer science
JKU Focus areas
- Digital Transformation