|
Workshop B2: Efficient Computation of Gröbner Bases
Date: February 27 - March 03
Chairmen: Jean-Charles Faugère, Hans-Gert Gräbe, Viktor Levandovskyy, Quoc-Nam Tran
Monday, February 27th |
|
09.00-09.30 | | H. Engl, V. Levandovskyy, A. Zapletal | | Kick-Off: Salutatory |
09.30-09.40 | | A. Zapletal | | The Groebner Bases Bibliography |
09.40-10.00 | | Presentation of Problems
|
|
10.20-12.00 | | H.-G. Graebe | | Groebner Basics
|
|
|
12.15-13.00 | | C. Traverso | | Approximate arithmetic in Groebner bases |
|
14.30-16.00 | | Q.-N. Tran | | Efficient computation of Groebner bases for elimination using ideal-specified term orders |
16.30-17.15 | | H. Schoenemann | | Experiences with the Groebner Engine in Singular
|
|
17.30-18.15 | | M. Brickenstein | | Slimgb - a flexible Groebner Basis algorithm
|
|
Tuesday, February 28th |
|
09.00-10.30 | | V. Gerdt | | Computational aspects of constructing Groebner bases by involutive methods
|
|
11.00-11.45 | | G. Evans | | Noncommutative Involutive Bases / Noncommutative Groebner Walks
|
|
12.10-13.30 | | H.-G. Graebe | | The Groebner Factorizer and Polynomial System Solving
|
|
|
15.00-16.00 | | J. Abbott | | CoCoALib: a C++ Library for Groebner Basis Computation |
16.15-17.15 | | M. Caboara | | Basic Ideal/ModuleOperations
| dvi
|
17.30-18.00 | | S. King | | Computing Turaev-Viro invariants |
Wednesday, March 1st |
|
09.00-09.30 | | J.C. Faugère | | Introduction: Polynomial System Solving using Gröbner bases |
09.30-11.00 | | J.C. Faugère | | Efficient Algorithms for computing Gröbner bases |
11.20-12.40 | | F. Rouillier | | Zero Dimensional Solving, Part I |
|
14.00-14.45 | | L. Perret | | Applications of Gb in Crypto
|
|
14.45-15.30 | | R. Pearce | | Implementation of F4/Parallel Implementation
|
|
15.30-16.00 | | Participants | | Please submit your problem! |
|
17.00 | | Shuttle Bus to Hagenberg |
17.30-18.50 | | F. Rouillier, J.C. Faugère | | Polynomial System Solving: from the problem to the solution |
19.00 | | Buffet Dinner |
Thursday, March 2nd |
|
09.00-10.45 | | J.C. Faugère | | Efficient Computation of Gröbner bases for an elimination ordering. Decomposition of ideals. Benchmarks. |
11.00-12.00 | | F. Rouillier | | Zero Dimensional Solving, Part II |
12.00-13.00 | | M. Safey | | Critical Point Method: theory and practice using Gröbner Basis |
|
14.30-15.30 | | F. Rouillier | | Solving Parametric Systems: Theory |
15.30-16.30 | | G. Moroz | | Solving Parametric Systems: algorithms and applications
|
|
16.30-18.00 | | F. Rouillier, J.C. Faugère | | FGb + RS (Maple) |
Friday, March 3rd |
|
09.00-10.00 | | F. Seyfert | | Design of High Degree Asymmetric Filters using Polynomial System Solving |
10.00-11.00 | | P. Trebuchet | | Generalised normal forms and polynomial system solving |
11.00-12.00 | | B. Buchberger | | What is a Buchberger algorithm ? |
12.00-12.45 | | M. Wang | | Groebner Bases under Composition and Multivariate Matrix Factorization
|
| ppt
|
|
14.00-15.00 | | R. Pearce | | PolynomialTools |
15.00-16.00 | | M. Safey, G. Moroz | | RAGLib (Real Algebraic Geometry Library) and DVlib (solving parametric polynomial systems) |
17.00-... | | Problems submitted by participants: summary |
|
|