相关论文: On Polynomial Time Computable Numbers

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

There is a subset of computational problems that are computable in polynomial time for which an existing algorithm may not complete due to a lack of high performance technology on a mission field. We define a subclass of deterministic…

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…

Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Frequent itemsets form a polytope and can be found and analyzed with Linear Programming.

We develop the theory of multiple polylogarithms from analytic, Hodge and motivic point of view. Define the category of mixed Tate motives over a ring of integers in a number field. Describe explicitly the multiple polylogarithm Hopf…

Spacetimes which are conformally related to reducible 1+3 spacetimes are considered. We classify these spacetimes according to the conformal algebra of the underlying reducible spacetime, giving in each case canonical expressions for the…

We prove an asymptotic formula for the number of multi-quadratic number fields of bounded discriminant with a power-saving error term. Furthermore, we explicitly calculate the leading coefficient and extend our result to totally real…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.

We consider generalized closest return times of a complex polynomial of degree at least two. Most previous studies on this subject have focused on the properties of polynomials with particular return times, especially the Fibonacci numbers.…

We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…

We give a complete list of the one-dimensional groups definable in algebraically closed valued fields and i the pseudo-local fields, up to a finite index subgroup and a quotient by a finite subgroup.

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

We consider affine representable algebras, that is, finitely generated algebras over a field that can be embedded into some matrix algebra over a commutative algebra. We show that this algebra can in fact be chosen to be a polynomial…