Related papers: Some algorithms related to the Jacobian Conjecture
We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
We consider polynomial maps, which we call degree $d$-linear maps, that satisfy the Jacobian condition. We prove that certain infinite families of elements, which appear in the coefficients of the formal inverse of such maps, are in the…
We establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…
A method for computing probabilistic propositions is presented. It assumes the availability of a single external routine for computing the probability of one instantiated variable, given a conjunction of other instantiated variables. In…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture using a recursive formula for the Catalan numbers.
The Newton polytope related to a ``minimal" counterexample to the Jacobian conjecture is introduced and described. This description allows to obtain a sharper estimate for the geometric degree of the polynomial mapping given by a Jacobian…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
We define and study the notions of q-deductive systems, p-deductive systems, deductive systems, maximal and strongly maximal q-deductive systems in quantum-Wajsberg algebras. We also introduce the notion of congruences induced by deductive…
One of the aims of this article is to provide a class of polynomial mappings for which the Jacobian conjecture is true. Also, we state and prove several global univalence theorems and present a couple of applications of them.
We prove that if the Jacobian Conjecture in two variables is false and (P,Q) is a standard minimal pair, then the Newton polygon HH(P) of P must satisfy several restrictions that had not been found previously. This allows us to discard some…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
The Jacobian Conjecture states that any locally invertible polynomial system in C^n is globally invertible with polynomial inverse. C. W. Bass et al. (1982) proved a reduction theorem stating that the conjecture is true for any degree of…
Following the footprints of what have been done with the algorithm Stacksort, we investigate the preimages of the map associated with a slightly less well known algorithm, called Queuesort. After having described an equivalent version of…
The Jacobian Conjecture uses the equation $det(Jac(F))\in k^*$, which is a very short way to write down many equations putting restrictions on the coefficients of a polynomial map $F$. In characteristic $p$ these equations do not suffice to…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…