Related papers: Point Decomposition Problem in Binary Elliptic Cur…
In this paper, we give an explicit description of the de Rham and p-adic polylogarithms for elliptic curves using the Kronecker theta function. We prove in particular that when the elliptic curve has complex multiplication and good…
The aim of this article is to analyze numerical schemes using two-layer neural networks with infinite width for the resolution of the high-dimensional Poisson-Neumann partial differential equations (PDEs) with Neumann boundary conditions.…
In this paper we use variational methods to establish the existence of solutions for a class of nonlinear elliptic problems involving a combined convolution-type and Hardy nonlinearity with subcritical and critical growth.
We consider a class of generally non-self-adjoint eigenvalue problems which are nonlinear in the solution as well as in the eigenvalue parameter ("doubly" nonlinear). We prove a bifurcation result from simple isolated eigenvalues of the…
In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using the BQP model to solve the minimum sum coloring problem…
We develop a novel method for finding bifurcations for nonlinear systems of equations based on directly finding bifurcations through saddle points of extended quotients. The method is applied to find the saddle-node bifurcation point for…
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…
Two-point boundary value problems for a discrete Ermakov-Painlev\'e II equation are analysed by means of topological methods. In addition, an alternative variational approach is detailed. Existence of solutions is established for…
The article is devoted to the development of algorithmic methods ensuring efficient complexity bounds for strongly convex-concave saddle point problems in the case when one of the groups of variables is high-dimensional, and the other is…
Solving elliptic PDEs in more than one dimension can be a computationally expensive task. For some applications characterised by a high degree of anisotropy in the coefficients of the elliptic operator, such that the term with the highest…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
Elliptic partial differential equations arise in many fields of science and engineering such as steady state distribution of heat, fluid dynamics, structural/mechanical engineering, aerospace engineering and seismology etc. In three…
Semidefinite Programming (SDP) provides tight lower bounds for Optimal Power Flow problems. However, solving large-scale SDP problems requires exploiting sparsity. In this paper, we experiment several clique decomposition algorithms that…
In this paper we consider nonlinear elliptic PDEs of the type $$-\Delta_p u+a(x)|u|^{p-2}u=|u|^{p^*-2}u \qquad \mbox{ in }\Omega,$$ where $1<p<N$ and $p^*=Np/(N-p)$ is the critical Sobolev exponent, and allowing the asymptotic behavior of…
We study a notion of finite energy solutions to elliptic systems with power nonlinearities in R^n. We establish sharp pointwise decay estimates for positive and sign-changing solutions. By using these estimates, we obtain symmetry results…
Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…
A bivariate spline method is developed to numerically solve second order elliptic partial differential equations (PDE) in non-divergence form. The existence, uniqueness, stability as well as approximation properties of the discretized…
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…
Considering a certain interpolation problem, we derive a series of elliptic difference isomonodromic systems together with their Lax forms. These systems give a multivariate extension of the elliptic Painlev\'e equation.