#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2007

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Janko Böhm, Wolfram Decker, Santiago Laplagne, Gerhard Pfister, Andreas Steenpaß, Stefan Steidel
- J. Symb. Comput.
- 2013

Article history: Received 14 October 2011 Accepted 23 March 2012 Available online 4 July 2012

- Janko Böhm
- 2007

- Janko Böhm, Wolfram Decker, Claus Fieker, Gerhard Pfister
- Math. Comput.
- 2015

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)

- Janko Böhm, Wolfram Decker, Mathias Schulze
- IJAC
- 2014

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)

- Janko Böhm, David Eisenbud, Max J. Nitsche
- Experimental Mathematics
- 2012

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)

- Janko Böhm, Wolfram Decker, Simon Keicher, Yue Ren
- MACIS
- 2015

- JANKO BÖHM
- 2015

We present a new algorithm for computing integral bases in algebraic function fields, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of localization and, then, completion at each singularity of the curve. In this way, we are reduced to finding integral bases at the branches of the singularities. To solve… (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
- ›