In 1982 Richard P. Stanley conjectured that any finitely generated Zn-graded module M over a finitely generated Nn-graded K-algebra R can be decomposed in a direct sum M = ⊕t i=1 νi Si of finitely many free modules νi Si which have to satisfy some additional conditions. Besides homogeneity conditions the most important restriction is that the Si have to be subalgebras of R of dimension at least...

Many computer vision applications require robust estimation of the underlying geometry, in terms of camera motion and 3D structure of the scene. These robust methods often rely on running minimal solvers in a RANSAC framework. In this paper we show how we can make polynomial solvers based on the action matrix method faster, by careful selection of the monomial bases. These monomial bases have t...

Fiedler pencils are a family of strong linearizations for polynomials expressed in the monomial basis, that include the classical Frobenius companion pencils as special cases. We generalize the definition of a Fiedler pencil from monomials to a larger class of orthogonal polynomial bases. In particular, we derive Fiedler-comrade pencils for two bases that are extremely important in practical ap...

Classically, Gröbner 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 on these ideas by providing a class of valuations on k(x, y) that are suitable for this framework. For these valuations, we compute ν(k[x, y]∗) and use this ...

In this paper we focus on Gröbner bases over rings for the univariate case. We identify a useful property of minimal Gröbner bases, that we call the " predictable leading monomial (PLM) property ". The property is stronger than " row reducedness " and is crucial in a range of applications. The first part of the paper is tutorial in outlining how the PLM property enables straightforward solution...

1. Preliminaries 3 2. Gröbner Bases 3 2.1. Motivating Problems 3 2.2. Ordering of Monomials 3 2.3. The Division Algorithm in S = k[x1, . . . , xn] 5 2.4. Dickson’s Lemma 7 2.5. Gröbner Bases and the Hilbert Basis Theorem 10 2.6. Some Further Applications of Gröbner bases 18 3. Hilbert Functions 21 3.1. Macaulay’s Theorem 27 3.2. Hilbert Functions of Reduced Standard Graded k-algebras 37 3.3. Hi...

We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gröbner bases, factorization or sub-resultant computations.