Related papers: Some algorithms related to the Jacobian Conjecture

In this paper, we derive a handable expression for the Jacobi process semi group which is given by a bilinear series involving Jacobi polynomials. Our attempt uses a subordination of the considered process by means of a suitable random…

We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…

We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…

The main object of this paper is to present some general concepts of Bayesian inference and more specifically the estimation of the hyperparameters in inverse problems. We consider a general linear situation where we are given some data…

We describe a method for computing the Cassels-Tate pairing on the 2-Selmer group of the Jacobian of a genus 2 curve. This can be used to improve the upper bound coming from 2-descent for the rank of the group of rational points on the…

There is a strong interest in finding challenging instances of NP-hard problems, from the perspective of showing quantum advantage. Due to the limits of near-term NISQ devices, it is moreover useful if these instances are small. In this…

We describe a genetic algorithm to find extreme examples in the arithmetic of dynamical systems. The algorithm is applied to four problems: small (non-zero) canonical heights, many rational preperiodic points, long rational cycles, and long…

It is shown that under reasonable assumptions a Drake-style equation can be obtained for the probability that our universe is the result of a deliberate simulation. Evaluating loose bounds for certain terms in the equation shows that the…

The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…

We present some motivations and discuss various aspects of an approach to the Jacobian Conjecture in terms of irreducible elements and square-free elements.

We formulate and discuss two conjectures concerning recursive formulae for Branson's $Q$-curvatures. The proposed formulae describe all $Q$-curvatures on manifolds of all even dimensions in terms of respective lower order $Q$-curvatures and…

We study the Jacobian scheme of a plane algebraic curve at an ordinary singularity, characterizing it through a geometric property. We compute the Tjurina number for a family of curves at an ordinary singularity showing that it reaches the…

Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every…

We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…

We approach the Torelli problem of recostructing a curve from its Jacobian from a computational point of view. Following Dubrovin, we design a machinery to solve this problem effectively, which builds on methods in numerical algebraic…

A conjecture concerning some pairs of interfering estimates for some integrals is formulated in three equivalent versions. Its importance for the the Paley problem for plurisubharmonic functions and for certain classes of extremal problems…

A specialized algorithm for quadratic optimization (QO, or, formerly, QP) with disjoint linear constraints is presented. In the considered class of problems, a subset of variables are subject to linear equality constraints, while variables…

For any genus g greater than 1, we construct a family of dimension g+1 of pairs of hyperelliptic curves of genus g whose jacobian are 2^g isogeneous. ----- Pour tout genre g superieur ou egal a 2, nous construisons une famille a g+1…

This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems $Bx = b$ with positive definite $B$ for $x$. The goal is to replace the point estimates returned by existing methods with…

For a two-parameter family of lower triangular matrices with entries involving Jacobi polynomials an explicit inverse is given, with entries involving a sum of two Jacobi polynomials. The formula simplifies in the Gegenbauer case and then…