Related papers: On Using Expansions to the Base of -2
We discuss the basic properties of Lie groupoids, Lie algebroids and Lie pseudo-groups in view of applying these techniques to the analysis of Jordan-H\"older resolutions and, subsequently, to the integration of partial differential…
We introduce a common generalization of essentially all known methods for explicit computation of Selmer groups, which are used to bound the ranks of abelian varieties over global fields. We also simplify and extend the proofs relating what…
The survey presents the evolution of Short Weierstrass elliptic curves after their introduction in cryptography. Subsequently, this evolution resulted in the establishment of present elliptic curve computational standards. We discuss the…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
The main subject of this work is the difference between the coarse moduli space and the stack of hyperelliptic curves. We compute their Picard groups, giving explicit description of the generators. We get an application to the…
Castryck, Decru, and Smith used superspecial genus-2 curves and their Richelot isogeny graph for basing genus-2 isogeny cryptography, and recently, Costello and Smith devised an improved isogeny path-finding algorithm in the genus-2…
We construct a family of plane curves as pull-backs of a conic for abelian coverings of P^2. If the conic is tangent to the ramification lines one obtains a family of curves of degree 2n with 3n singularities of type A_{n-1}. We calculate…
This work studies the large sample properties of the posterior-based inference in the curved exponential family under increasing dimension. The curved structure arises from the imposition of various restrictions on the model, such as moment…
We give a bound on the primes dividing the denominators of invariants of Picard curves of genus 3 with complex multiplication. Unlike earlier bounds in genus 2 and 3, our bound is based not on bad reduction of curves, but on a very explicit…
The Weil pairing on elliptic curves has deep links with discrete logarithm problems. In practice, to better suit the functionalities of cryptosystems, one often needs to modify the original Weil pairing via what is called a distortion map.…
We introduce a white graph expansion for the method of perturbative continuous unitary transformations when implemented as a linked cluster expansion. The essential idea behind an expansion in white graphs is to perform an optimized…
We present the pseudo-particle multipole method (P2M2), a new method to handle multipole expansion in fast multipole method and treecode. This method uses a small number of pseudo-particles to express multipole expansion. With this method,…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
Quantum Monte Carlo is used to investigate the possibility of d_{x^2-y^2} superconductivity in the two-dimensional repulsive Hubbard model. A small energy scale relevant to possible pairing requires a care (i.e., sufficiently small level…
Three decades ago, Montgomery introduced a new elliptic curve model for use in Lenstra's ECM factorization algorithm. Since then, his curves and the algorithms associated with them have become foundational in the implementation of elliptic…
The expansion method of Lie algebras by a semigroup or S-expansion is generalized to act directly on the group manifold, and not only at the level of its Lie algebra. The consistency of this generalization with the dual formulation of the…
Under quite general conditions critical phenomena can be described with high order linked cluster expansions. The coefficients of the series admit a graphical expansion that is generated with the aid of computers. Our generalization of…
Efficient scalar multiplication in Abelian groups (which is an important operation in public key cryptography) can be performed using digital expansions. Apart from rational integer bases (double-and-add algorithm), imaginary quadratic…
Dynamical linked cluster expansions are linked cluster expansions with hopping parameter terms endowed with their own dynamics. They amount to a generalization of series expansions from 2-point to point-link-point interactions. We outline…