Related papers: Twisted $\boldsymbol{\mu}_4$-normal form for ellip…

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…

We introduce conformal Courant algebroids, a mild generalization of Courant algebroids in which only a conformal structure rather than a bilinear form is assumed. We introduce exact conformal Courant algebroids and show they are classified…

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

In this note we extend the theory of twists of elliptic curves as presented in various standard texts for characteristic not equal to two or three to the remaining characteristics. For this, we make explicit use of the correspondence…

We generalize the tree doubling and Christofides algorithm, the two most common approximations for TSP, to parameterized approximations for ATSP. The parameters we consider for the respective parameterizations are upper bounded by the…

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny…

An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.

A pre-modular form $Z_n(\sigma; \tau)$ of weight $\tfrac{1}{2} n(n + 1)$ is introduced for each $n \in \Bbb N$, where $(\sigma, \tau) \in \Bbb C \times \Bbb H$, such that for $E_\tau = \Bbb C/(\Bbb Z + \Bbb Z \tau)$, every non-trivial zero…

Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…

Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…

In this article we give explicit formulae for a lift of the relative Frobenius morphism between elliptic curves and show how one can compute this lift in the case of ordinary reduction in odd characteristic. Our theory can also be used in…

We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and…

Hexahedral meshes are an ubiquitous domain for the numerical resolution of partial differential equations. Computing a pure hexahedral mesh from an adaptively refined grid is a prominent approach to automatic hexmeshing, and requires the…

Quantum computers have the potential to break classical cryptographic systems by efficiently solving problems such as the elliptic curve discrete logarithm problem using Shor's algorithm. While resource estimates for factoring-based…

A twisted-austere $k$-fold $(M, \mu)$ in $\mathbb R^n$ consists of a $k$-dimensional submanifold $M$ of $\mathbb R^n$ together with a closed $1$-form $\mu$ on $M$ such that the `twisted conormal bundle' $N^* M + \mu$ is a special Lagrangian…

We consider lattice Hamiltonian realizations of ($d$+1)-dimensional Dijkgraaf-Witten theory. In (2+1)d, it is well-known that the Hamiltonian yields point-like excitations classified by irreducible representations of the twisted quantum…

We show that the average number of integral points on elliptic curves, counted modulo the natural involution on a punctured elliptic curve, is bounded from above by $2.1 \times 10^8$. To prove it, we design a descent map, whose prototype…

We introduce a near-linear complexity (geometric and meshless/algebraic) multigrid/multiresolution method for PDEs with rough ($L^\infty$) coefficients with rigorous a-priori accuracy and performance estimates. The method is discovered…

The well-known graph-based clustering methods, including spectral clustering, symmetric non-negative matrix factorization, and doubly stochastic normalization, can be viewed as relaxations of the kernel $k$-means approach. However, we posit…

We present a generalization of the symbol calculus from ordinary multiple polylogarithms to their elliptic counterparts. Our formalism is based on a special case of a coaction on large classes of periods that is applied in particular to…