Related papers: Elliptic butterflies
It is possible to solve the Einstein constraint equations as an evolutionary rather than an elliptic system. Here we consider the Gauss constraint in electrodynamics as a toy model for thist. We use a combination of the evolutionary method…
In this paper, we investigate the Cauchy problem for both linear and semi-linear elliptic equations. In general, the equations have the form \[ \frac{\partial^{2}}{\partial…
In this paper, we study the twisted Gan-Gross-Prasad problem for classical groups over finite fields. We formulate a multiplicity formula for Deligne-Lusztig characters and give a complete answer for cuspidal representations arising from…
We study the regularity and well-posedness of the local, first-order forward-backward mean field games system, assuming a polynomially growing cost function and a Hamiltonian of quadratic growth. We consider systems and terminal data that…
We propose a First-Order System Least Squares (FOSLS) method based on deep-learning for numerically solving second-order elliptic PDEs. The method we propose is capable of dealing with either variational and non-variational problems, and…
A new fast multipole formulation for solving elliptic difference equations on unbounded domains and its parallel implementation are presented. These difference equations can arise directly in the description of physical systems, e.g.…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
This paper presents a brief historical survey of iterative methods for solving linear systems of equations. The journey begins with Gauss who developed the first known method that can be termed iterative. The early 20th century saw good…
We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…
We consider an iterative procedure to solve quasilinear elliptic systems with $p$-growth. The scheme was first considered by Koshelev in the quadratic case $p=2$. We present numerical applications as well as applications to higher…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
We prove regularity estimates for weak solutions to the Dirichlet problem for a divergence form elliptic operator. We give $L^p$ estimates for the second derivative for $p<2$. Our work generalizes results due to Miranda [28].
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…
We solve the problem of characteristic numbers of elliptic curves in any dimensional projective space The answers are given in the form of effective recursions. Many numerical examples are provided. A C++ program implementing all the…
This paper investigates the formulation and implementation of Bayesian inverse problems to learn input parameters of partial differential equations (PDEs) defined on manifolds. Specifically, we study the inverse problem of determining the…