Leiter des Fachgebiets:
Prof. Dr. Peter Bürgisser

The conference Geometry in Complexity and Computations takes place at the University of Konstanz on September 21-23. This event celebrates Peter Bürgisser and his contributions to the field on the occasion of his 60th birthday.

On March 16, Peter Bürgisser will give an invited talk at the 38th International Symposium on Theoretical Aspects of Computer Science. He will speak about Optimization, Complexity and Invariant Theory, based on recent research with Cole Franks, Ankit Garg, Rafael Oliveira, Michael Walter and Avi Wigderson. The corresponding extended abstract / survey article is publicly available at the Dagstuhl Publication Server.

We are very proud to announce that our group member Paul Breiding will receive the Early Career Prize of the SIAM Activity Group on Algebraic Geometry. The prize will be awarded at the SIAM Conference on Applied Algebraic Geometry in August 2021.

Congratulations on this great achievement, Paul!

There is a nice Youtube-Video available, which gives a short summary of the paper

"A stable, polynomial-time algorithm for the eigenpair problem" by Armentano, Beltrán, Bürgisser, Cucker and Shub

that appeared in the Journal of the European Mathematical Society.

Der neue Termin für die Algebra 1 Klausur (2. Prüfungstermin) steht inzwischen fest. Für weitere Informationen wird auf die Webseite von Dirk Kussin verwiesen.

The case study Invariant Theory for Maximum Likelihood Estimation is published at the website of the University of Oxford, https://www.maths.ox.ac.uk/node/35937. It is based on a recent preprint (arXiv:2003.13662), that connects notions of stability from Invariant Theory with maximum likelihood estimation from (Algebraic) Statistics.
This is a joint research project of our group member Philipp Reichenbach and his collaborators Carlos Améndola (TU Munich), Kathlén Kohn (KTH Stockholm) and Anna Seigal (University of Oxford).

Our group member Paul Breiding recently wrote an article about topological data analysis from an algebraic-geometric point of view. It was published in  SIAM News, Issue January/February 2020. Please find in the following the linked online version of the article including a short demonstration video, as well as the corresponding issue of SIAM News as a pdf-file.

The article "3264 Conics in a Second" by our group member Paul Breiding and his co-authors Bernd Sturmfels and Sascha Timme was recently published in the Notices of the AMS (issue January 2020). Moreover, one image of the article is used prominently for the cover design!

Please consider the following pdf for the full press release on this subject. It also contains a link to the article. For a website version, we refer to the following linked page on the website of the Max Planck Institute for Mathematics in the Sciences, Leipzig.

Recently the SIAM Conference on Applied Algebraic Geometry 2019 took place. The presentations of the minisymposium "Efficient algorithms for geometric invariant theory" as well as additional material are now available under the following link.

In the winter term 2019/20 there will be a Thematic Einstein Semester on (Applied) Algebraic Geometry, called Varieties, Polyhedra, Computation.

As a preparation there will be several courses and seminars at FU, HU and TU in the summer semester 2019. In particular, at TU Berlin the three lectures Real Algebra, Condition: The Geometry of Numerical Algorithms and Variations on Bezout's theorem as well as the software seminar Numerical Nonlinear Algebra will be offered. Moreover, right before the start of the winter term there will be a fall school and an opening conference.

We are very much looking forward to this exciting program, that shall intensify the collaboration of the three Berlin universities in (Applied) Algebraic Geometry. Please stay tuned via the homepage of the Thematic Einstein Semester.

There is an erratum for Theorem 5.7 in the paper The Complexity of Factors of Multivariate Polynomials by Peter Bürgisser, which was published in 2004 in Foundations of Computational Mathematics.

The time to apply for our open postdoc positions has been extended. The new application deadline is 30.11.2018.

Our research group has an opening for two five year postdoc positions within Prof. Bürgisser's ERC Advanced Grant "COCAN: Complexity and Condition in Algebra and Numerics". For more information click here.
Likely, there will be an opening for a PhD position in the near future.

The workshop "Complexity of Numerical Computation: A workshop in honor of Felipe Cucker" (or simply Felipe's Fest) will take place in Berlin from the 19th to the 23rd of August 2019. Colleagues and friends of Felipe Cucker will celebrate his 60th birthday presenting talks on the complexity of numerical computation and related topics. Additionally, the conference will have a lecture by Felipe on art and mathematics and an exhibition of the art project Approximation Theory in which Felipe took part. Every person in Berlin with an interest in mathematics is welcome to attend the conference. More information in this link.

This workshop is organized by Peter Bürgisser, Teresa Krick, Javier Peña and Steve Smale and will be funded by the Einstein Foundation Berlin and the European Research Council (ERC) (agreement grant No 787840).

The Graduiertenkolleg 2434: Facets of Complexity, which is run jointly by FU Berlin, TU Berlin, and HU Berlin, has a new webpage!

We are happy to report that Peter Bürgisser has been awarded an ERC Advanced Grant for his project COCAN: Complexity and Condition in Algebra and Numerics. This provides funding for basic research in the amount of 2.3 million Euro for five years.   

From the 4th until the 8th of June, it will take place at the Institute of Advanced Study at Princeton the workshop "Optimization, Complexity and Invariant Theory" organized by Prof. Avi Widgerson. This workshop will explore "the connections between complexity and optimization with algebra and analysis, which have emerged from the works on operator scaling". Registration is for free. More information in this link.