Related papers: Deterministic elliptic curve primality proving for…

We prove that any exact quantum algorithm searching an ordered list of N elements requires more than \frac{1}{\pi}(\ln(N)-1) queries to the list. This improves upon the previously best known lower bound of {1/12}\log_2(N) - O(1). Our proof…

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

In this paper we obtained an original integer sequence based on the properties of the multinomial coefficient. We investigated a property of the sequence that shows connection with a primality testing. For any prime n the n-th term in the…

Let $E$ be a nonisotrivial elliptic curve over $\mathbb{Q}(T)$ and denote the rank of the abelian group $E(\mathbb{Q}(T))$ by $r$. For all but finitely many $t\in \mathbb{Q}$, specialization will give an elliptic curve $E_t$ over…

Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…

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…

The number of n-gram features grows exponentially in n, making it computationally demanding to compute the most frequent n-grams even for n as small as 3. Motivated by our production machine learning system built on n-gram features, we ask:…

In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective…

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…

We present new optimal and heuristic algorithms for exact synthesis of multi-qubit unitaries and isometries. For example, our algorithms find Clifford and T circuits for unitaries with entries in $\mathbb{Z}[i,1/\sqrt{2}]$. The optimal…

Let $K_i$ be a number field for all $i \in \mathbb{Z}_{> 0}$ and let $\mathcal{E}$ be a family of elliptic curves containing infinitely many members defined over $K_i$ for all $i$. Fix a rational prime $p$. We give sufficient conditions for…

Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational…

Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to…

A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in…

We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…

We consider the primes which divide the denominator of the x-coordinate of a sequence of rational points on an elliptic curve. It is expected that for every sufficiently large value of the index, each term should be divisible by a primitive…

For an elliptic curve $E$ defined over a number field $K$, the heuristic density of the set of primes of $K$ for which $E$ has cyclic reduction is given by an inclusion-exclusion sum $\delta_{E/K}$ involving the degrees of the $m$-division…

In this paper, we investigate extreme values of $\omega(E(\mathbb{F}_p))$, where $E/\mathbb{Q}$ is an elliptic curve with complex multiplication and $\omega$ is the number-of-distinct-prime-divisors function. For fixed $\gamma > 1$, we…

Let E_k denote the elliptic curve defined by y^2 = x(x^2 - k^2). We consider the curves with k = pl, p = l = 1 mod 8 primes, and show that the density of rank-0 curves among them is at least 1/2 by explicitly constructing nontrivial…