Singular is a computer algebra system for polynomial calculations. Singularity is a calculation software for polynomial computations in commutative algebra, algebraic geometry and singularity theory.Its main computational objects are ideals and modules over a wide variety of baserings. The baserings are rings of polynomials over a field (eg, finite fields, the rationals, floats, algebraic extensions, transcendental extensions), or localizations thereof, or quotient rings with respect to a ideal.It characteristics fast and general implementations for computing Groebner and standard bases, including the Buchberger algorithm and Mora's Tangent Cone algorithm. Its interactive interface and C as programming language can be extended by libraries written in the programming language.Here are some unique key features of "singular" · main computational objects: ideals / modules over polynomial rings very general on different areas to ground. · Wide variety of algorithms implemented in the kernel (written in C / C ++).· many more algorithms implemented as libraries singular. • Intuitive, C-like programming language. · Extensive documentation: Manual (info, ps and pdf), Publications. · Available for most hardware and software platforms: Unix (HP-UX, SunOS, Solaris, Linux, AIX), Windows, Macintosh.What's new in this version: · This version is mainly a bugfix release, but it also contains some new features. · Speed has been improved for 64-bit architectures. · Libraries of dmod.lib and perron.lib were added. · Center.lib has been improved. ncalg.lib has been revised. · New algorithms have been added primdec.lib. · An improved version of slimgb was incorporated in groebner. • The generator modules (modgen) has been improved. • The construction process has been improved to automatically build without patches on 64-bit architectures.