Gerhard Pfister

Learn More
SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commutative algebra, algebraic geometry, and singularity theory. SINGULAR’s main computational objects are polynomials, ideals and modules over a large variety of rings, including important non-commutative rings. SINGULAR features one of the fastest(More)
Let R = k[Y1, Y2, Y3]/(f ), f = Y 3 1 + Y 3 2 + Y 3 3 , where k is an algebraically closed field with char k = 3. Using Atiyah bundle classification over elliptic curves we describe the matrix factorizations of the graded, indecomposable reflexive R-modules, equivalently we describe explicitly the indecomposable bundles over the projective curve V (f )⊂ P2(More)
BACKGROUND Approximately 30% of schizophrenic patients defined as treatment refractory significantly improve with clozapine. However, clozapine produces agranulocytosis in approximately 1% to 2% of patients in the United States. The mechanism of clozapine-induced agranulocytosis has not been established, but evidence suggests an immune-mediated mechanism.(More)
We characterise the class of finite solvable groups by two-variable identities in a way similar to the characterisation of finite nilpotent groups by Engel identities. Let u1 = x−2y−1x, and un+1 = [xunx−1, yuny−1]. The main result states that a finite group G is solvable if and only if for some n the identity un(x, y) ≡ 1 holds in G. We also develop a new(More)
We characterise the solvable groups in the class of finite groups by an inductively defined sequence of two-variable identities. Our main theorem is the analogue of a classical theorem of Zorn which gives a characterisation of the nilpotent groups in the class of finite groups by a sequence of two-variable identities. To cite this article: T. Bandman et(More)
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction. Successively enlarging the set of primes if needed, this method is guaranteed to work if we restrict ourselves to “good”(More)