相关论文: Twisted $\boldsymbol{\mu}_4$-normal form for ellip…
We construct an abstract pseudodifferential calculus with operator-valued symbol, adapted to the treatment of Coulomb-type interactions, and we apply it to study the quantum evolution of molecules in the Born-Oppenheimer approximation, in…
The `excised ensemble', a random matrix model for the zeros of quadratic twist families of elliptic curve $L$-functions, was introduced by Due\~nez, Huynh, Keating, Miller and Snaith. The excised model is motivated by a formula for central…
In the shape analysis approach to computer vision problems, one treats shapes as points in an infinite-dimensional Riemannian manifold, thereby facilitating algorithms for statistical calculations such as geodesic distance between shapes…
In this paper, we consider the problem of distributed optimisation of a separable convex cost function over a graph, where every edge and node in the graph could carry both linear equality and/or inequality constraints. We show how to…
We derive an analytic representation of the ten-particle, two-loop double-box integral as an elliptic integral over weight-three polylogarithms. To obtain this form, we first derive a four-fold, rational (Feynman-)parametric representation…
Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected problem about this…
We provide explicit faithful re-embeddings for all hyperelliptic curves of genus at most three and an algorithmic way to construct them. Both in the faithful tropicalization algorithm and the proofs of correctness, we showcase OSCAR-methods…
We propose a new randomized algorithm for solving L2-regularized least-squares problems based on sketching. We consider two of the most popular random embeddings, namely, Gaussian embeddings and the Subsampled Randomized Hadamard Transform…
We describe geometric algorithms that generalize the classical continued fraction algorithm for the torus to all translation surfaces in hyperelliptic components of translation surfaces. We show that these algorithms produce all saddle…
The minimum-weight $2$-edge-connected spanning subgraph (2-ECSS) problem is a natural generalization of the well-studied minimum-weight spanning tree (MST) problem, and it has received considerable attention in the area of network design.…
We present an enhanced algorithm for exploring mirror symmetry for elliptic curves through the correspondence of algebraic and tropical geometry, focusing on Gromov-Witten invariants of elliptic curves and, in particular, Hurwitz numbers.…
Consider the elliptic curve $E$ given by the Weierstrass equation $y^2 = x^3 - 11x - 14$, which has complex multiplication by the order of conductor $2$ inside $\mathbb{Z}[i]$. It was recently observed in a paper of Daniels and…
Graph spanners and emulators are sparse structures that approximately preserve distances of the original graph. While there has been an extensive amount of work on additive spanners, so far little attention was given to weighted graphs.…
We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first…
We consider a wide range of regularized stochastic minimization problems with two regularization terms, one of which is composed with a linear function. This optimization model abstracts a number of important applications in artificial…
This thesis captures the ongoing development of twisted cubes, which is a modification of cubes (in a topological sense) where its homotopy type theory does not require paths or higher paths to be invertible. My original motivation to…
This paper proposes new explicit formulas for the doubling and addition step in Miller's algorithm to compute the Tate pairing. For Edwards curves the formulas come from a new way of seeing the arithmetic. We state the first geometric…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…
We study Tamagawa numbers of elliptic curves with torsion $\mathbb{Z}/2\mathbb{Z}\oplus \mathbb{Z}/14\mathbb{Z}$ over cubic fields and of elliptic curves with an $n-$isogeny over $\mathbb{Q}$, for…