Related papers: Algorithmic Arithmetic Fewnomial Theory I: One Var…

Withdrawn by author - Superseded by arXiv:0910.5106 [math.FA].

There is an irreparable error in the proof of Theorem 3.26 in our "Model Theory of Fields with Virtually Free Group Actions" paper and we withdraw the claim of having proved that theorem. In fact, that theorem is false in a very strong…

We construct long sequences of braids that are descending with respect to the standard order of braids (``Dehornoy order''), and we deduce that, contrary to all usual algebraic properties of braids, certain simple combinatorial statements…

We prove the following function field analog of the Hardy-Littlewood conjecture (which generalizes the twin prime conjecture) over large finite fields. Let n,r be positive integers and q an odd prime power. For distinct polynomials a_1,…

This article has been withdrawn due to an error in a proof of the main result.

Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…

We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…

The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of…

Denote by $\lambda(n)$ Liouville's function concerning the parity of the number of prime divisors of $n$. Using a theorem of Allouche, Mend\`es France, and Peyri\`ere and many classical results from the theory of the distribution of prime…

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

We study the question of whether the "termination with probability 1" property of a randomized algorithm is preserved when one replaces the atomic registers that the algorithm uses with linearizable (implementations of) registers. We show…

We give an elementary proof of the fact that a binomial random variable $X$ with parameters $n$ and $0.29/n \le p < 1$ with probability at least $1/4$ strictly exceeds its expectation. We also show that for $1/n \le p < 1 - 1/n$, $X$…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

The paper proves the intermediate value theorem for polynomials and power series over a valued field with divisible valuation group and infinite residue field. Some further results on the behaviour of the valuation are obtained using…

There are errors in the proof of the uniqueness of arithmetic subgroups of the smallest covolume. In this note we correct the proof, obtain certain results which were stated as a conjecture, and we give several remarks on further…

Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for…

This paper has been withdrawn

A novel notion of unpredictable strings is revealed and utilized to define deterministic unpredictable sequences on a finite number of symbols. We prove the first law of large strings for random processes in discrete time, which confirms…

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…