### A database of invariant rings.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Let K be a field, S = K[x 1, … x n] be a polynomial ring in n variables over K and I ⊂ S be an ideal. We give a procedure to compute a prime filtration of S/I. We proceed as in the classical case by constructing an ascending chain of ideals of S starting from I and ending at S. The procedure of this paper is developed and has been implemented in the computer algebra system Singular.

In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving problems for polynomials in one variable in an optimal way. So, using this method we can compute the greatest common divisor of two polynomials in one variable with integer coefficients avoiding the exponential growth of the coefficients that will appear if we use the Euclidean Algorithm.In this note, generalizing a forgotten construction appearing in [Hab], we extend the Subresultant Theory to the...

A module for conflict detection in A-SMGCS is presented. It supervises the operations that the ground controller has to perform. It doesn?t depend on the topology of the terminal area. The system guarantees the safety of the proposed situation, that is, the impossibility that a conflict arises among aircrafts (and also road vehicles) obeying the signaling. We suppose that the terminal area has stop bars (or semaphores) controlling all intersections and accesses between runways, taxiways, exits,...

BackgroundIndependence models among variables is one of the most relevant topics in epidemiology, particularly in molecular epidemiology for the study of gene-gene and gene-environment interactions. They have been studied using three main kinds of analysis: regression analysis, data mining approaches and Bayesian model selection. Recently, methods of algebraic statistics have been extensively used for applications to biology. In this paper we present...

We present algorithms and their implementation in the computer algebra system Singular 2.0 for the computation of equations for moduli spaces for semiquasihomogeneous singularities w.r.t. right equivalence. In addition, we describe the structure of the stabilizer group of Brieskorn-Pham singularities.

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article.

An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] up to a previously given bound. For w-homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel then this set is minimal.

We give an effective procedure to find minimal bases for ideals of the ring of polynomials over the integers.