相关论文: The Groebner basis and solution set of a polynomia…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture using a recursive formula for the Catalan numbers.
We prove that the Jacobian conjecture is false if and only if there exists a solution to a certain system of polynomial equations. We analyse the solution set of this system. In particular we prove that it is zero dimensional.
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
Based on the reduction of degree in polynomial mappings and some known results in algebraic geometry, by introducing the Brouwer degree, a tool from differential topology, algebraic topology and algebraic geometry, we completely prove the…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
The Jacobian conjecture over a field of characteristic zero is considered directly in view of the nonlinear partial differential equations it is associated with. Exploring the integrals of such partial differential equations, this work…
We consider computational and implementation issues for the completion of monomial sets to involution using different involutive divisions. Every of these divisions produces its own completion procedure. For the polynomial case it yields an…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
We give a simple and entirely elementary proof of Gasper's theorem on the Markov sequence problem for Jacobi polynomials. It is based on the spectral analysis of an operator that arises in the study of a probabilistic model of colliding…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
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.
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…