Related papers: On Polynomial Time Computable Numbers

We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…

Over the split-octonion algebra defined over an arbitrary field, we solve all polynomial equations whose coefficients are scalar except for the constant term. As an application, we determine the square and cubic roots of an octonion.

We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…

We define a $q$-deformation of the classical ring of integer-valued polynomials which we call the ring of quantum integer-valued polynomials. We show that this ring has a remarkable combinatorial structure and enjoys many positivity…

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

We prove that the main examples in the theory of algebraic differential equations possess a remarkable total differential overconvergence property. This allows one to consider solutions to these equations with coordinates in algebraically…

We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…

We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Quickly convergent series are given to compute polyzeta numbers. The formula involves an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatorics has a very simple geometric interpretation: it corresponds…

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.

We consider the expansion of the real field by the group of rational points of an elliptic curve over the rational numbers. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets…

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

We develop a theory of oscillatory integrals whose phase is given by the trace of a polynomial over an algebraic number field. We present an application to the singular integral for a version of Tarry's problem for algebraic integers.

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

We study algebraic and model-theoretic properties of existentially closed fields with an action of a fixed finite group. Such fields turn out to be pseudo-algebraically closed in a rather strong sense. We place this work in a more general…

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…

Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…