Related papers: Number Theory in OSCAR
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
We introduce the AlgebraicStatistics section of the OSCAR computer algebra system. We give an overview of its extensible design and highlight its features including serialization of data types for sharing results and creating databases, and…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
We give illustrative examples of how the computer algebra system OSCAR can support research in commutative algebra and algebraic geometry. We start with a thorough introduction to Groebner basis techniques, with particular emphasis on the…
Let $K$ be an imaginary quadratic field. For an order $\mathcal{O}$ in $K$ and a positive integer $N$, let $K_{\mathcal{O},\,N}$ be the ray class field of $\mathcal{O}$ modulo $N\mathcal{O}$. We deal with various subjects related to…
In this survey, we present a detailed guide on using the computer algebra system OSCAR to compute monomial bases for simple, finite-dimensional modules of simple, complex Lie algebras. We will also demonstrate how to determine monomial…
We report on an implementation of Galois groups in the new computer algebra system OSCAR. As an application we compute Galois groups of Ehrhart polynomials of lattice polytope
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
We characterize finite Galois extensions $K$ of the field of rational numbers in terms of the rings ${\rm Int}_{\mathbb{Q}}(\mathcal O_K)$, recently introduced by Loper and Werner, consisting of those polynomials which have coefficients in…
We propose a modification of the predictions of the Cohen--Lenstra heuristic for class groups of number fields in the case where roots of unity are present in the base field. As evidence for this modified formula we provide a large set of…
We compute K-theory for ring C*-algebras in the case of higher roots of unity and thereby completely determine the K-theory for ring C*-algebras attached to rings of integers in arbitrary number fields.
The main purpose of the paper is to formulate a probabilistic model for Arakelov class groups in families of number fields, offering a correction to the Cohen--Lenstra--Martinet heuristic on ideal class groups. To that end, we show that…
We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…
In this article, we develop new methods for counting integral orbits having bounded invariants that lie inside the cusps of fundamental domains for coregular representations. We illustrate these methods for a representation of cardinal…
Number fields and their rings of integers, which generalize the rational numbers and the integers, are foundational objects in number theory. There are several computer algebra systems and databases concerned with the computational aspects…
A series of lecture notes on the elementary theory of algebraic numbers, using only knowledge of a first-semester graduate course in algebra (primarily groups and rings). No prerequisite knowledge of fields is required. Based primarily on…
Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…
We compute the K-theory of ring C*-algebras for polynomial rings over finite fields. The key ingredient is a duality theorem which we had obtained in a previous paper. It allows us to show that the K-theory of these algebras has a ring…
We report on the computer implementation for toric geometry in the computer algebra system $\texttt{OSCAR}$. The main architectural feature of $\texttt{OSCAR}$ is that its four fundamental tools $\texttt{Antic}$ (Hecke, Nemo),…