相关论文: Improving DISPGB Algorithm Using the Discriminant …

Computation of parallel lines (envelopes) to parabolas, ellipses, and hyperbolas is of importance in structure engineering and theory of mechanisms. Homogeneous polynomials that implicitly define parallel lines for the given offset to a…

We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Let $I = ( f_1, \dots, f_n )$ be a homogeneous ideal in the polynomial ring $K[x_1, \dots,x_n]$ over a field $K$ generated by generic polynomials. Using an incremental approach based on a method by Gao, Guan and Volny, and properties of the…

We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…

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…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between non-homogeneous Gr\"obner bases and homogeneous Gr\"obner bases. As a consequence, a general principle of…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.

In this paper we introduce a multistep generalization of the guess-and-determine or hybrid strategy for solving a system of multivariate polynomial equations over a finite field. In particular, we propose performing the exhaustive…

In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…

The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a "geometric…

Parametric Gr\"obner bases have been studied for more than 15 years and are now a further developed subject. Here we propose a general study of parametric standard bases, that is with local orders. We mainly focus on the commutative case…

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…

We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and…