Related papers: Computing Bits of Algebraic Numbers
We discuss the application of computer algebra to problems commonly arising in numerical relativity, such as the derivation of 3+1-splits, manipulation of evolution equations and automatic code generation. Particular emphasis is put on…
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…
Many formal languages include binders as well as operators that satisfy equational axioms, such as commutativity. Here we consider the nominal language, a general formal framework which provides support for the representation of binders,…
We illustrate the Lie theoretic capabilities of the computational algebra system GAP4 by reporting on results on nilpotent orbits of simple Lie algebras that have been obtained using computations in that system. Concerning reachable…
Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
We present a computational framework (Rio) in the ADM 3+1 approach for numerical relativity. This work enables us to carry out high resolution calculations for initial data of two arbitrary black holes. We use the transverse conformal…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…
In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…
Cantor gave in his fundamental article an elegant proof of the countability of real algebraic numbers based on a positive integer height, denoted by him as N, of integer and irreducible polynomials of given degree (denoted by him as n) with…
With disks and networks providing gigabytes per second, parsing decimal numbers from strings becomes a bottleneck. We consider the problem of parsing decimal numbers to the nearest binary floating-point value. The general problem requires…
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…
Computational techniques are extensively applied in nonlinear science. However, while the use of computers for research has been expressive, the evaluation of numerical results does not grow in the same pace. Hammel et al. (Journal of…
Given a number field $L$, we define the degree of an algebraic number $v \in L$ with respect to a choice of a primitive element of $L$. We propose the question of computing the minimal degrees of algebraic numbers in $L$, and examine these…
The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, $\mathcal{E}$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries:…