相关论文: An algorithm for computing the Weierstrass normal …

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q…

We give a stack-theoretic proof for some results on families of hyperelliptic curves.

The problem of representing a class of maps in a form suited for application of normal form methods is revisited. It is shown that using the methods of Lie series and of Lie transform a normal form algorithm is constructed in a…

Consider a hyperelliptic curve of genus $2$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $6$ Weierstrass points. We classify the structure of the potentially stable reduction of such…

A computer-algebra aided method is carried out, for determining geometric objects associated to differential operators that satisfy the elliptic ansatz. This results in examples of Lame curves with double reduction and in the explicit…

Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…

We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.

In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…

In this paper, we introduce a tensor neural network based machine learning method for solving the elliptic partial differential equations with random coefficients in a bounded physical domain. With the help of tensor product structure, we…

In this talk we discuss Feynman integrals which are related to elliptic curves. We show with the help of an explicit example that in the set of master integrals more than one elliptic curve may occur. The technique of maximal cuts is a…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

We revisit the regularity theory for uniformly elliptic equations.

We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…

There are two ways to compute Poincar\'e-Dulac normal forms of systems of ODEs. Under the original approach used by Poincar\'e the normalizing transformation is explicitly computed. On each step, the normalizing procedure requires the…

Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…

Over the complex numbers, Pl\"ucker's formula computes the number of inflection points of a linear series of projective dimension $r$ and degree $d$ on a curve of genus $g$. Here we explore the geometric meaning of a natural analogue of…

Using a mixture of classical and probabilistic techniques we investigate the convexity of solutions to the elliptic pde associated with a certain generalized Ornstein-Uhlenbeck process.

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

An algorithm for computing /pi(N) is presented.It is shown that using a symmetry of natural numbers we can easily compute /pi(N).This method relies on the fact that counting the number of odd composites not exceeding N suffices to calculate…