Related papers: Computing Bits of Algebraic Numbers

We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…

It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A'…

We provide a simple way to add, multiply, invert, and take traces and norms of algebraic integers of a number field using integral matrices. With formulas for the integral bases of the ring of integers of at least a significant proportion…

It is well known that the set of algebraic numbers (let us call it $A$) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using \G1-based…

In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of…

We establish the first effective improvements on the Liouville inequality for approximation to complex non-real algebraic numbers by complex algebraic numbers of degree at most 4.

We present the first linear lower bound for the number of bits required to be accessed in the worst case to increment an integer in an arbitrary space- optimal binary representation. The best previously known lower bound was logarithmic. It…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…

Let G be a simple algebraic group over an algebraically closed field with Lie algebra g. Then the orbits of nilpotent elements of g under the adjoint action of G have been classified. We describe a simple algorithm for finding a…

In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…

We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

In this paper we continue the investigation of a real number object, i.e., an object representing the real numbers, in categories of relations. Our axiomatization is based on a relation algebraic version of Tarski's axioms of the real…

Let X be an algebraic curve over Q and t a non-constant Q-rational function on X such that Q(t) is a proper subfield of Q(X). For every integer n pick a point P_n on X such that t(P_n)=n. We conjecture that, for large N, among the number…

We introduce an axiomatization for the notion of computation. Based on the idea of Brouwer choice sequences, we construct a model, denoted by $E$, which satisfies our axioms and $E \models \mathrm{ P \neq NP}$. In other words, regarding…