Learn 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)
Normalization is a fundamental ring-theoretic operation; geometrically it resolves singularities in codimension one. Existing algorithmic methods for computing the normalization rely on a common recipe: successively enlarge the given ring in form of an endomorphism ring of a certain (fractional) ideal until the process becomes stationary. While Vasconcelos'(More)
Unprojection theory analyzes and constructs complicated commutative rings in terms of simpler ones. Our main result is that, on the algebraic level of Stanley-Reisner rings, stellar subdivisions of Gorenstein* simpli-cial complexes correspond to unprojections of type Kustin-Miller. As an application of our methods we study the minimal resolution of Stanley–(More)
Computations over the rational numbers often suffer from intermediate coefficient swell. One solution to this problem is to apply the given algorithm modulo a number of primes and then lift the modular results to the rationals. This method is guaranteed to work if we use a sufficiently large set of good primes. In many applications, however, there is no(More)
  • 1