Search

Consider an action of a connected solvable group G on an affine variety X. This paper presents an algorithm that constructs a semi-invariant f ∈ K [ X ] = : R and computes the invariant ring (R f) G together with a presentation. The morphism X f → Spec ((R f) G) obtained from the algorithm is a universal geometric quotient. In fact, it is even better than that: a so-called excellent quotient. If R is a polynomial ring, the algorithm requires no Gröbner basis computations. If R is a complete intersection, then so is (R f) G. [ABSTRACT FROM AUTHOR]

Powers of (monomial) ideals is a subject that still calls attraction in various ways. In this paper we present a nice presentation of high powers of ideals in a certain class in K [ x 1 , ... , x n ] and K [ [ x 1 , ... , x n ] ]. As an interesting application it leads to an algorithm for computation of the Ratliff–Rush operation on ideals in that class. The Ratliff–Rush operation itself has several applications, for instance, if I is a regular m -primary ideal in a local ring (R , m) , then the Ratliff–Rush associated ideal I ˜ is the unique largest ideal containing I with the same Hilbert polynomial as I. [ABSTRACT FROM AUTHOR]

In this paper, we study the notion of special ideals. We generalize the results on those as well as the algorithm obtained for finite dimensional power series rings by Mordechai Katzman and Wenliang Zhang to finite dimensional polynomial rings. [ABSTRACT FROM AUTHOR]

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. The framework presented in Telen et al. (2018) uses truncated normal forms (TNFs) to compute the algebra structure of R / I and the solutions of I. This framework allows for the use of much more general bases than the standard monomials for R / I. This is exploited in this paper to introduce the use of two special (non-monomial) types of basis functions with nice properties. This allows us, for instance, to adapt the basis functions to the expected location of the roots of I. We also propose algorithms for efficient computation of TNFs and a generalization of the construction of TNFs in the case of non-generic zero-dimensional systems. The potential of the TNF method and usefulness of the new results are exposed by many experiments. [ABSTRACT FROM AUTHOR]

Let R be a non-commutative PID finitely generated as a module over its center C . In this paper we give a criterion to decide effectively whether two given elements f , g ∈ R are similar, that is, if there exists an isomorphism of left R -modules between R / R f and R / R g . Since these modules are of finite length, we also consider the more general problem of deciding when two given left R -modules of finite length are isomorphic. This criterion allows the design of algorithms when R is an Ore extension of a skew-field whose center is a commutative polynomial ring. We propose two methods which, essentially, check the equality of the rational canonical forms of certain matrices with coefficients in C associated to each of the modules. These algorithms are based on the fact that, if R is finitely generated as a C -module, then the existence of an isomorphism of R -modules can be reduced to checking the existence of an isomorphism of C -modules. Actually, we prove this result in the realm of non-commutative principal ideal domains, generalizing a version given by Jacobson for some Ore extensions of a skew field by an automorphism. [ABSTRACT FROM AUTHOR]