Related papers: Elliptic Gau{\ss} sums and Schoof's algorithm
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm, two-space method, the shifted inverse power method, and the polynomial…
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to…
In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…
We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To…
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.
Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…
Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Monte Carlo algorithm for performing inference in models with…
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 find a new class of the Fuchsian equations, which have an algebraic geometric solutions with the parameter belonging to a hyperelliptic curve. Methods of calculating the algebraic genus of the curve, and its branching points, are…
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
This note presents a formula for the enumerative invariants of arbitrary genus in toric surfaces. The formula computes the number of curves of a given genus through a collection of generic points in the surface. The answer is given in terms…
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied…
In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…
We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…
We put together some known theoretical results and the fact that certain computations can be done efficiently in SAGE to come up with a fast algorithm for calculating congruence primes linking a newform with integer coefficients (i.e. a…
A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic…
Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…
We develop a cut finite element method for a second order elliptic coupled bulk-surface model problem. We prove a priori estimates for the energy and $L^2$ norms of the error. Using stabilization terms we show that the resulting algebraic…
We present a hybridization technique for summation-by-parts finite difference methods with weak enforcement of interface and boundary conditions for second order, linear elliptic partial differential equations. The method is based on…
Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…