Related papers: Gr\"obner Bases for Linearized Polynomials
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…
Analytical expressions for spectrum, eigenfunctions and dipole matrix elements of a square double quantum well (DQW) are presented for a general case when the potential in different regions of the DQW has different heights and effective…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the given equation system significantly faster than what is…
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…
We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.
In this note we develop a coalgebraic approach to the study of solutions of linear difference equations over modules and rings. Some known results about linearly recursive sequences over base fields are generalized to linearly (bi)recursive…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
We give an example where the number of elements of a Groebner basis in a Boolean ring is not polynomially bounded in terms of the bitsize and degrees of the input.
In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…
The main result of the paper is the construction of explicit uniformly bounded basis in the spaces of complex homogenous polynomials on the unit ball of $C^3$, extending an earlier result of the author in the $C^2$ case
Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…
We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…
We explicitly provide minimal Gr\"obner bases for simple, finite-dimensional modules of complex Lie algebras of types A and C, using a homogeneous ordering that is compatible with the PBW filtration on the universal enveloping algebras.
In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…
Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…