Related papers: Quadratic Frobenius probable prime tests costing t…
We study the distribution of spacings between squares modulo q as the number of prime divisors of q tends to infinity. In an earlier paper Kurlberg and Rudnick proved that the spacing distribution for square free q is Poissonian, this paper…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
We consider a fractional Brownian motion with unknown linear drift such that the drift coefficient has a prior normal distribution and construct a sequential test for the hypothesis that the drift is positive versus the alternative that it…
We study the distributions of waiting times in variations of the $q$-sooner and later waiting time problem. One variation imposes length and frequency quotas on the runs of successes and failures. Another case considers binary trials for…
We consider the Partition problem and propose a deterministic FPTAS (Fully Polynomial-Time Approximation Scheme) that runs in $\widetilde{O}(n + 1/\varepsilon)$-time. This is the best possible (up to a polylogarithmic factor) assuming the…
In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…
We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).
We analyze the results of the test of $\pi/2$ qubit rotations on the public quantum computer provided by IBM. We measure a single qubit rotated by $\pi/2$ about a random axis, and we accumulate vast statistics of the results. The test…
We compute the probability that a bipartite quantum state is separable by Monte Carlo sampling. This is carried out for rebits, qubits and quaterbits. We sampled $5\times 10^{11}$ points for each of these three cases. The results strongly…
We analyze the mean cost of the partial match queries in random two-dimensional quadtrees. The method is based on fragmentation theory. The convergence is guaranteed by a coupling argument of Markov chains, whereas the value of the limit is…
In this work, a rationalized algorithm for calculating the quotient of two quaternions is presented which reduces the number of underlying real multiplications. Hardware for fast multiplication is much more expensive than hardware for fast…
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…
The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…
The computation of two Bayesian predictive distributions which are discrete mixtures of incomplete beta functions is considered. The number of iterations can easily become large for these distributions and thus, the accuracy of the result…
We compute a number of invariants of singularities defined via the Frobenius morphism for seminormal affine toric varieties over fields of characteristic p > 0. Our main technical tool is a combinatorial description of the potential…
Let E be an elliptic curve with complex multiplication by R, where R is an order of discriminant D<-4 of an imaginary quadratic field K . If a prime number p is decomposed completely in the ring class field associated with R, then E has…
We present an algorithm to decide the primality of Proth numbers, N=2^e t+1, without assuming any unproven hypothesis. The expected running time and the worst case running time of the algorithm are O ((t log t + log N)log N) and O ((t log t…
The Diophantine equation 4/n=1/x+1/y+1/z for a Pythagorean prime n is split into two independent Diophantine equations, which correspond to two different types of solution. The solvability of these equations forces certain restrictions on…