Related papers: Involutive Algorithms for Computing Groebner Bases
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
Given a finite set $\mathbf{X}$ of distinct points, Marinari-Mora's 'Axis of Evil Theorem' states that a combinatorial algorithm and interpolation enable to find a 'linear' factorization for a lexicographical minimal Groebner basis…
Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…
Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…
We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
Quaternionic polynomials are generated by quaternionic variables and the quaternionic product. This paper proposes the generating ideal of quaternionic polynomials in tensor algebra, finds the Groebner base of the ideal in the case of pure…
The number field sieve is the most efficient known algorithm for factoring large integers that are free of small prime factors. For the polynomial selection stage of the algorithm, Montgomery proposed a method of generating polynomials…
Dotsenko and Vallette discovered an extension to nonsymmetric operads of Buchberger's algorithm for Gr\"obner bases of polynomial ideals. In the free nonsymmetric operad with one ternary operation $({\ast}{\ast}{\ast})$, we compute a…
This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…