News | Dates | Topics | Code Examples | Literature | Contact | Credits | Home

Day | Time | Room |

wednesdays | 01.15 - 02.45 pm | Hs 19 |

thursdays | 09.15 - 10.45 am | S 110 |

- Integer and polynomial arithmetics, fast multiplication, gcd computations, complexity of algorithms, modular techniques
- Resultants and extended gcd computations.
- Multivariate polynomials, Gröbner bases for ideals and modules, modular methods, Faugère's F4 and F5 algorithm, syzygies, free resolutions.
- (Squarefree) Factorization, Hensel lifting, factorization with LLL, primality tests, factorization over algebraic number fields.

Overview | julia file | jupyter notebook file |

Inverse kinematic problem | singular file | |

Introduction to julia | julia file | jupyter notebook file |

Sieve of Eratosthenes | julia file | |

Composite tests | julia file | |

Resultant | julia file | |

Gröbner bases -- Buchberger's algorithm | julia file |

The following list is not sorted, but includes books covering some topics of the
lecture:

- Cohen: A Course in Computational Algebraic Number Theory
- Cox, Little, O'Shea: Ideals, Varieties, and Algorithms
- von zur Gathen: Modern Computer Algebra
- Greuel, Pfister: A SINGULAR introduction to Commutative Algebra

Just drop by at my office or write an email to **ederc at mathematik dot uni-kl
dot de**.