Related papers: Faster computation of the Tate pairing
An efficient hybrid numerical method for multiple scattering calculations is proposed. We use the well established doubling--adding method to find the reflection function of the lowermost homogeneous slab comprising the atmosphere of our…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
We prove a 1966 conjecture of Tate concerning the Artin-Tate pairing on the Brauer group of a surface over a finite field, which is the analogue of the Cassels-Tate pairing. Tate asked if this pairing is always alternating and we find an…
In this paper, we study the alternating Euler $T$-sums and related sums by using the method of contour integration. We establish the explicit formulas for all linear and quadratic Euler $T$-sums and related sums. Some interesting new…
This paper presents division polynomials for twisted Edwards curves. Their chief property is that they characterise the $n$-torsion points of a given twisted Edwards curve. We also present results concerning the coefficients of these…
Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…
Recently I proposed a new method for solving the pairing Hamiltonian with the pair-condensate wavefunction ansatz based on the Heisenberg equations of motion for the density matrix operators. In this work an improved version is given by…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
Let $F$ be a field of characteristic not 2 or 3. The first Tits construction is a well-known tripling process to construct separable cubic Jordan algebras, especially Albert algebras. We generalize the first Tits construction by choosing…
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…
A formula expressing a point of order 8 on an elliptic curve, in terms of the roots of the associated cubic polynomial, is given. Doubling such a point yields a point of order 4 distinct from the well-known points of order 4 given in…
In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the $d^\text{th}$ order cumulant can be presented in the form of an $d$-dimensional tensor, the algorithm is presented…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
In this paper, we study some cohomology groups and quadratic twists of elliptic curves, and apply Tate local duality and the results of Kramer-Tunnell on local norm cokernel to give a refined version of Yu's formula in the case of elliptic…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends previous work of ours to all curves for which a good lift to characteristic zero is known. We develop all the necessary bounds,…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
We establish a version of the Landen's transformation for Weierstrass functions and invariants that is applicable to general lattices in complex plane. Using it we present an effective method for computing Weierstrass functions, their…
A family of original formulae for computing number PI and its proof are presented. An algorithm is proposed to validate the results of this new algorithm.