Related papers: The elliptic curve discrete logarithm problem and …

In this short note, we investigate simultaneous recovery inverse problems for semilinear elliptic equations with partial data. The main technique is based on higher order linearization and monotonicity approaches. With these methods at…

Isolating block and isolating neighborhood methods have previously been implemented to find transit trajectories and orbits around libration points in the autonomous circular restricted three-body problem. For some applications, the direct…

In this paper, we investigate the complexity of one-dimensional dynamic programming, or more specifically, of the Least-Weight Subsequence (LWS) problem: Given a sequence of $n$ data items together with weights for every pair of the items,…

Steady vortices for the three-dimensional Euler equation for inviscid incompressible flows and for the shallow water equation are constructed and showed to tend asymptotically to singular vortex filaments. The construction is based on the…

Pairings have been widely used since their introduction to cryptography. They can be applied to identity-based encryption, tripartite Diffie-Hellman key agreement, blockchain and other cryptographic schemes. The Acceleration of pairing…

We give explicit formulae for the logarithmic class group pairing on an elliptic curve defined over a number field. Then we relate it to the descent relative to a suitable cyclic isogeny. This allows us to connect the resulting Selmer group…

Let $E_1, \ldots, E_s $ be $s$, not necessary distinct, elliptic curves over $\mathbb{Q}$. We give upper bounds on the frequency of $s$-tuples of points in $E_1(\mathbb{Q})\times \ldots \times E_s(\mathbb{Q})$ whose denominators or…

We consider the elliptic-elliptic, focussing Davey-Stewartson equations, which have an explicit bright line soliton solution. The existence of a family of periodic solitons, which have the profile of the line soliton in the longitudinal…

We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These…

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…

Each elliptic curve can be embedded uniquely in the projective plane, up to projective equivalence. The hessian curve of the embedding is generically a new elliptic curve, whose isomorphism type depends only on that of the initial elliptic…

In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inapproximability. Here we try to go further in this direction.…

Given a connected undirected weighted graph, we are concerned with problems related to partitioning the graph. First of all we look for the closest disconnected graph (the minimum cut problem), here with respect to the Euclidean norm. We…

We consider the elliptic three body problem as a perturbation of the circular problem. We show that for sufficiently small eccentricities of the elliptic problem, and for energies sufficiently close to the energy of the libration point L2,…

It was recently shown by the authors that a semilinear elliptic equation can be represented as an infinite-dimensional dynamical system in terms of boundary data on a shrinking one-parameter family of domains. The resulting system is…

In this paper, a weak Local Linearization scheme for Stochastic Differential Equations (SDEs) with multiplicative noise is introduced. First, for a time discretization, the solution of the SDE is locally approximated by the solution of the…

We compute the differential equations for the two remaining integral topologies contributing to the leading colour two-loop amplitudes for $pp \rightarrow t\bar{t}j$. We derive differential equations for the master integrals by solving the…

Semi-discrete Galerkin formulations of transient wave equations, either with conforming or discontinuous Galerkin finite element discretizations, typically lead to large systems of ordinary differential equations. When explicit time…

Discontinuous Galerkin (DG) methods for solving elliptic equations are gaining popularity in the computational physics community for their high-order spectral convergence and their potential for parallelization on computing clusters.…

We consider a class of singularly perturbed elliptic problems with nonautonomous asymptotically linear nonlinearities. The dependence on the spatial coordinates comes from the presence of a potential and of a function representing a…