Name: Numerical (Nonlinear) Algebra in the Real World
Start: 2025-02-03T12:00:00+01:00
End: 2025-02-06T18:00:00+01:00
Location: MPI-CBG

Numerical (Nonlinear) Algebra in the Real World

from Monday, February 3, 2025 (12:00 PM) to Thursday, February 6, 2025 (6:00 PM)

Monday, February 3, 2025

1:00 PM Collaboration rooms available, CSBD 121, 205, 306
Collaboration rooms available, CSBD 121, 205, 306
1:00 PM - 5:00 PM
Room: CSBD 121, 205, 306

Participants go to lunch, either at our Cantine or at a nearby restaurant. Either way, self-pay.
Participants go to lunch, either at our Cantine or at a nearby restaurant. Either way, self-pay.
1:00 PM - 2:00 PM
Room: Canteen

2:00 PM Registration and greeting
Registration and greeting
2:00 PM - 2:30 PM
Room: Atrium

2:30 PM Welcome
Welcome
2:30 PM - 2:45 PM
Room: Large auditorium

2:45 PM Jon Hauenstein - Four computations in real numerical algebraic geometry
Jon Hauenstein - Four computations in real numerical algebraic geometry
2:45 PM - 3:30 PM
Room: Large auditorium Many problems in science and engineering can be formulated as computing information about the set of real points satisfying polynomial equations and inequalities. Some examples include synthesizing a linkage in kinematics, computing and analyzing the steady-state solutions to a polynomial dynamical system, and reconstructing a scene in computer vision. Since different problems could require a different amount of information about the real solution set, this talk will summarize four computations in real numerical algebraic geometry: 1) existence of a real solution, 2) smooth points and dimension of the real solution set, 3) decomposition into smoothly connected components, and 4) cell decomposition for a complete description of the real solution set. Each computation will be illustrated with an example along with a discussion about benefits and potential drawbacks. This talk covers computational methods created jointly with a variety of collaborators including Silviana Amethyst, Dan Bates, Gian Mario Besana, Joe Cummings, Sandra Di Rocco, Wenrui Hao, Hoon Hoon, Katherine Harris, Cliff Smyth, Andrew Sommese, Agnes Szanto, and Charles Wampler.

3:30 PM Coffee and collaboration
Coffee and collaboration
3:30 PM - 4:15 PM
Room: Atrium, CBG Seminar Room 2

4:15 PM Andreas Münch - Continuum models of solutions and gels of charge regulating polyelectrolytes such as RNA and DNA and their phase behaviour under varying environmental conditions
Andreas Münch - Continuum models of solutions and gels of charge regulating polyelectrolytes such as RNA and DNA and their phase behaviour under varying environmental conditions
4:15 PM - 5:00 PM
Room: Large auditorium We develop continuum models for solutions of polyelectrolytes as a minimal system for biological molecules. We investigate their propensity to undergo phase separation by a combination of bifurcation analysis and time-dependent numerical solutions. In the case of polyelectrolyte gels, we describe the impact of salt concentration in the environment on the pattern forming behaviour under the effect of elasticity and on the structure of the electric double layer. We also explore the often neglected property of charge regulation on the phase behaviour of macro-ion solutions.

5:00 PM Evening collaboration
Evening collaboration
5:00 PM - 6:00 PM
Room: Large auditorium
Tuesday, February 4, 2025

9:00 AM Collaboration rooms available, CSBD 121, 205, 306
Collaboration rooms available, CSBD 121, 205, 306
9:00 AM - 5:00 PM
Room: CSBD 121, 205, 306

Frank Jülicher - Active Matter Hydrodynamics: From Droplets to Tissues
Frank Jülicher - Active Matter Hydrodynamics: From Droplets to Tissues
9:00 AM - 9:45 AM
Room: Large auditorium One of the most fascinating features of living matter is its extraordinary dynamics. This is revealed when observing cells under the microscope. They move, they divide and the undergo shape changes. Cells can generate forces and movements. From a materials perspective, cellular matter is soft and liquid-like, but exhibits complex spatio-temporal organization. To understand cells and tissue as complex forms of matter, we need theories that can capture material properties, taking into account active processes, such as the generation of forces and movements. This active matter theory which describes systems driven away from thermodynamic equilibrium by the supply of chemical energy, was developed during the last 20 years. I will give an overview of several biological systems, where active matter theory has advanced our understanding and has motivated new theoretical questions, ranging from active droplets and active surfaces to theoretical approaches for multicellular systems.

9:45 AM Pierre Haas - Stories of ecological structures
Pierre Haas - Stories of ecological structures
9:45 AM - 10:30 AM
Room: Large auditorium The dynamics of ecological communities are intrinsically linked to ecological structures such as the network of species interactions or the phenotypic substructure of different species. In this talk, I will give two examples of minimal models that elucidate the interplay of these structures and ecological dynamics. In both cases, I will highlight open questions that (new) (numerical) algebraic methods could answer. In the first part of my talk, I will analyse the effect of the network of competitive, mutualistic, and predator-prey interactions on stability of coexistence [1]. I will show that the possibility of stable coexistence in ecologies with Lotka-Volterra dynamics is determined completely by "irreducible ecologies", and I will explain how exhaustive analysis of all such interaction networks of N<6 species suggests that, strikingly, these irreducible ecologies form an exponentially small subset of all ecologies, as do the mathematically curious "impossible ecologies" in which stable coexistence is non-trivially impossible. In the second part of my talk, I will introduce a minimal model of spatial structure in the competition of two species. One of these species switches, both stochastically and in response to the other species, to a phenotype resilient to competition [2]. In particular, I will ask: How does this phenotypic switching affect travelling waves by which one species invades the other? Combining exact and numerical results, I will reveal that, very surprisingly, phenotypic switching does not change the speed of these travelling waves. [1] Meng, Horvát, Modes, and Haas, arXiv:2309.16261 [2] Gupta and Haas, in preparation

10:30 AM Group photo
Group photo
10:30 AM - 10:45 AM
Room: Large auditorium

10:45 AM Coffee and collaboration, Atrium, Seminar Room 2
Coffee and collaboration, Atrium, Seminar Room 2
10:45 AM - 11:15 AM
Room: Atrium, Seminar Room 2

11:15 AM Ada Wang - Computing Arrangements of Hypersurfaces
Ada Wang - Computing Arrangements of Hypersurfaces
11:15 AM - 12:00 PM
Room: Large auditorium In this talk, I will present a Julia package, HypersurfaceRegions.jl, for computing all connected components in the complement of an arrangement of real algebraic hypersurfaces in $R^n$. The package is based on a modified implementation of the algorithm from the paper "Smooth Connectivity in Real Algebraic Varieties" by Cummings et al. I will outline the theory behind the algorithm and our implementation. I will demonstrate the use of the package through various examples.

12:00 PM Ivo Sbalzarini - Particle Methods: Numerical Computation on Point Clouds
Ivo Sbalzarini - Particle Methods: Numerical Computation on Point Clouds
12:00 PM - 12:45 PM
Room: Large auditorium Point clouds provide an expressive abstraction for tasks across computational mathematics. They can be used as collocation point sets in numerical analysis, but also as a data structure for machine learning and statistical inference. I provide an introduction to how differential operators can be consistently approximated on point clouds by solving polynomial systems. This includes a meshfree geometric-computing framework that leverages polynomial regression in a unisolvent Newton-Chebyshev basis to represent complex-shaped and dynamic surfaces. Together, these render particle methods a viable choice for problems involving non-parametric or dynamic geometries, as exemplified by our work on active matter models of biological tissue morphogenesis.

12:45 PM Announcements
Announcements
12:45 PM - 1:00 PM
Room: Large auditorium

1:00 PM Lunch. Participants go to lunch, either at our Kantine or at a nearby restaurant. Either way, self-pay.
Lunch. Participants go to lunch, either at our Kantine or at a nearby restaurant. Either way, self-pay.
1:00 PM - 2:00 PM
Room: Kantine and restaurants, CBG Seminar Room 2.

2:00 PM Collaboration
Collaboration
2:00 PM - 2:45 PM
Room: Large auditorium

2:45 PM Torkel Loman - Catalyst: Fast and flexible modelling of reaction networks
Torkel Loman - Catalyst: Fast and flexible modelling of reaction networks
2:45 PM - 3:30 PM
Room: Large auditorium Chemical reaction networks (CRNs) are a type of model commonly used in biology and chemistry. Their applications include the investigation of cellular system functions, designing drugs (pharmacology), forecasting epidemic progression (epidemiology), and optimisation of chemical synthesis pipelines. The Catalyst.jl modelling tool provides an interface for creating such CRN models in the Julia programming language (a recently developed programming language comparable to e.g. Matlab and Python). Next, it enables various forms of model analysis and simulation (e.g. deterministic/stochastic, nonspatial/spatial). Connections to packages in the wider Julia ecosystem also enable workflows such as bifurcation analysis and the finding of steady states through homotopy continuations. This talk will show how CRN models can be implemented and analysed in Julia, and how this can be applied to real-world problems across biology.

3:30 PM Coffee and collaboration, Atrium, Seminar Room 2
Coffee and collaboration, Atrium, Seminar Room 2
3:30 PM - 4:15 PM
Room: Atrium, Seminar Room 2

4:15 PM Aida Maraj - Toric Geometry in Brownian motion tree models and their generalizations
Aida Maraj - Toric Geometry in Brownian motion tree models and their generalizations
4:15 PM - 5:00 PM
Room: Large auditorium Algebraic geometry has recently provided a new approach to advancing problems in multivariate Gaussian models. This is achieved by identifying Gaussian distributions with symmetric matrices and analyzing the polynomials that vanish on these matrices, known as ideals. The talk will focus on Brownian motion tree (BMT) models, a type of Gaussian model used in phylogenetics, and their generalizations to phylogenetic trees with colored and zeroed nodes. The set of concentration matrices on BMT models has hidden toric geometry. We use it to provide formulas on the maximum likelihood degree and its dual. Their generalization is not always toric. We share conditions for toricness under a linear transformation.

5:00 PM Evening collaboration
Evening collaboration
5:00 PM - 6:00 PM
Room: Large auditorium
Wednesday, February 5, 2025

9:00 AM Collaboration rooms available, CSBD 121, 205, 306
Collaboration rooms available, CSBD 121, 205, 306
9:00 AM - 5:00 PM
Room: CSBD 121, 205, 306

Oskar Henriksson - The numerical algebraic geometry of steady state equations
Oskar Henriksson - The numerical algebraic geometry of steady state equations
9:00 AM - 9:45 AM
Room: Large auditorium The steady states of a chemical reaction network with power-law kinetics can be described by a polynomial system with fixed support and coefficients that depend on parameters called rate constants and total amounts. This so-called vertical parametrization of the coefficients typically introduces dependencies among them, such that the generic root count over the complex numbers drops below the mixed volume bound predicted by the BKK theorem. In this talk, I will give an overview of recent results on the generic geometry of these systems and their incidence varieties. I will also discuss tropical techniques for constructing homotopies that allow solving the systems by tracing an optimal number of paths. This is based on joint work, partly in progress, with Elisenda Feliu, Paul Helminck, Beatriz Pascual-Escudero, Yue Ren, Benjamin Schröter, and Máté Telek.

9:45 AM Viktoriia Borovik - Numerical homotopies from SAGBI bases
Viktoriia Borovik - Numerical homotopies from SAGBI bases
9:45 AM - 10:30 AM
Room: Large auditorium I will present homotopy continuation methods for solving 0-dimensional polynomial systems, where each polynomial is expressed as a general linear combination of prescribed, fixed polynomials. This approach involves selecting a specific starting system for homotopy continuation, leveraging the theory of SAGBI (Khovanskii bases) and toric geometry. For square systems, SAGBI homotopies can significantly reduce the number of solution paths to track compared to polyhedral homotopies, which are currently the default in HomotopyContinuation.jl. As a direct application of this theory, I will demonstrate the SAGBI homotopy with two examples: (1) finding approximate stationary states for coupled driven nonlinear resonators — a problem in nonlinear dynamics, and (2) computing approximate solutions to the electronic Schrödinger equation in coupled cluster theory, which arises in quantum chemistry.

10:30 AM Coffee and collaboration, Atrium, Seminar Room *3*
Coffee and collaboration, Atrium, Seminar Room *3*
10:30 AM - 11:15 AM
Room: Atrium, Seminar Room *3*

11:15 AM Fabian Faulstich - Numerical Algebraic Geometry and Correlated Electrons
Fabian Faulstich - Numerical Algebraic Geometry and Correlated Electrons
11:15 AM - 12:00 PM
Room: Large auditorium We discuss the algebra and combinatorics underpinning coupled cluster (CC) theory for quantum many-body systems. The high-dimensional eigenvalue problems that encode the electronic Schrödinger equation are approximated by polynomial systems at various levels of truncation. The exponential parametrization of the eigenstates gives rise to truncation varieties. These generalize Grassmannians in their Plücker embedding. We offer a detailed study of truncation varieties and their CC degrees, a complexity measure for solving the CC equations. We also discuss the solutions of the CC equations.

12:00 PM Irem Portakal - Computing equilibra in game theory
Irem Portakal - Computing equilibra in game theory
12:00 PM - 12:45 PM
Room: Large auditorium In 1950, Nash published a very influential two-page paper proving the existence of Nash equilibria for any finite game. The proof uses an elegant application of the Kakutani fixed-point theorem from the field of topology. It has, however, been noted that in some cases the Nash equilibrium fails to predict the most beneficial outcome for all players. To address this, generalizations of Nash equilibria such as correlated and dependency equilibria were introduced. This talk explores these notions of equilibria and presents methods to compute them from a nonlinear algebraic perspective, offering insights into their computational challenges.

12:45 PM Announcements
Announcements
12:45 PM - 1:00 PM
Room: Large auditorium

1:00 PM Lunch. Participants go to lunch, either at our Kantine or at a nearby restaurant. Either way, self-pay.
Lunch. Participants go to lunch, either at our Kantine or at a nearby restaurant. Either way, self-pay.
1:00 PM - 2:00 PM
Room: Kantine, Restaurants, Seminar room 2.

2:00 PM Collaboration
Collaboration
2:00 PM - 2:45 PM
Room: Large auditorium

2:45 PM Georgy Scholten - Globtim: An attempt at global optimization over compact domain via polynomial approximations
Georgy Scholten - Globtim: An attempt at global optimization over compact domain via polynomial approximations
2:45 PM - 3:30 PM
Room: Large auditorium Let $f$ be a $L^2$ measurable function defined over the $n$-dimensional unit-cube and enjoying a quadratic growth property around all of its local minimizers on that domain. Our objective is to design an algorithm that can compute all local minimizers of $f$. We work in a computational framework where the function $f$ is given by an evaluation program $\Gamma$. This program takes as input rational points in that domain and returns the value of $f$ in finite precision at these points. We are considering both the framework where this evaluation program is exact -- if the image of $f$ can be represented with a finite amount of bits -- or noisy -- in that case, we assume that the evaluation function takes an extra parameter $\eta$ and returns an approximation that is $\eta$-close to the true value of $f$".

3:30 PM Coffee and collaboration, Atrium, Seminar Room 2
Coffee and collaboration, Atrium, Seminar Room 2
3:30 PM - 4:15 PM
Room: Atrium, Seminar room 2

4:15 PM Türkü Özlüm Çelik - Wave Parameters from Discrete Data
Türkü Özlüm Çelik - Wave Parameters from Discrete Data
4:15 PM - 5:00 PM
Room: Large auditorium We study approximating underlying mathematical structures via point cloud data within the framework of integrable systems, with a particular emphasis on the Kadomtsev-Petviashvili (KP) equation. This is a pivotal element in the theory of integrable systems, and models nonlinear wave interactions. Our objective is to determine the finite-genus KP solution parameters that optimally correspond to a prescribed dataset of discrete point values. The methodology employs foundational principles from Fourier analysis alongside standard optimization techniques. A beautiful mathematical challenge we run into is the Schottky problem, which asks for characterization of Jacobians of algebraic curves among abelian varieties. This is joint with Daniele Agostini, Bernard Deconinck, Charles Wang.

5:00 PM Evening collaboration
Evening collaboration
5:00 PM - 6:00 PM
Room: Large auditorium

6:00 PM Conference meal at MPI-CBG Kantine
Conference meal at MPI-CBG Kantine
6:00 PM - 7:30 PM
Room: CBG Kantine We will have a delightful meal together at MPI-CBG in our Kantine, with food provided for participants by our expert internal catering company ISSMA

7:30 PM

7:30 PM - 9:00 PM
Room: Large auditorium
Thursday, February 6, 2025

9:00 AM Collaboration rooms available, CSBD 121, 205, 306
Collaboration rooms available, CSBD 121, 205, 306
9:00 AM - 5:00 PM
Room: CSBD 121, 205, 306

Simon Telen - Chebyshev varieties
Simon Telen - Chebyshev varieties
9:00 AM - 9:45 AM
Room: Small auditorium Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials or their multivariate generalizations. We determine the dimension, degree, singular locus and defining equations of these varieties. We explain how they play the role of toric varieties in sparse polynomial root finding, when monomials are replaced by Chebyshev polynomials. We present numerical root finding algorithms that exploit our results. Joint work with Zaïneb Bel-Afia and Chiara Meroni.

9:45 AM Dmitrii Pavlov - Gibbs manifolds
Dmitrii Pavlov - Gibbs manifolds
9:45 AM - 10:30 AM
Room: Small auditorium Gibbs manifolds are images of affine spaces of symmetric matrices under the exponential map. They arise in applications such as optimization, statistics and quantum physics, where they extend the ubiquitous role of toric geometry. The Gibbs variety is the zero locus of all polynomials that vanish on the Gibbs manifold. In this talk, I will describe some properties of this variety, and present two implicitization algorithms (one symbolic and one numerical) for it. In particular, we will see on examples that numerical methods allow to compute more complicated Gibbs varieties. This is based on joint work with Bernd Sturmfels and Simon Telen.

10:30 AM Coffee and collaboration, Atrium, Seminar Room *3*
Coffee and collaboration, Atrium, Seminar Room *3*
10:30 AM - 11:15 AM
Room: Atrium, Seminar room *3*

11:15 AM Jiayi Li - Taming Non-convexity in Shallow Neural Networks with Algebraic Activations
Jiayi Li - Taming Non-convexity in Shallow Neural Networks with Algebraic Activations
11:15 AM - 12:00 PM
Room: Small auditorium One of the key challenges in optimizing neural networks is the inherent high-dimensionality and non-convexity of the objective function. A single neuron with Sigmoid activation is known to have the number of local minima grow exponentially in the dimension based on square loss. Properly tuned gradient-based methods converge to a stationary point, prompting the question: which stationary point do these methods typically find, and how can we bound their convergence rates? Beyond popular ReLU and sigmoid functions, recent work has explored polynomial and rational activations. Polynomial activations have shown promise in computer vision tasks, while rational activations have been applied to solving PDEs and training Generative Adversarial Networks. Notably, well-known activations such as ReLU and other smooth functions can be approximated by polynomials or rational functions up to a desired accuracy. In this talk, I will (1) describe the training dynamics of shallow neural networks with these algebraic activations, focusing on rational networks as a representative case, (2) characterize their stationary points and investigate how poles, factorization symmetries, and higher-dimensional parameter spaces complicate gradient-based optimization, and (3) discuss the existence and elimination of “spurious valleys” (connected components of sub-level sets that exclude a global minimum) in different architectures. I will demonstrate the theoretical findings with numerical experiments.

12:00 PM Lightning presentations
Lightning presentations
12:00 PM - 12:45 PM
Room: Small auditorium

12:45 PM Announcements
Announcements
12:45 PM - 1:00 PM
Room: Small auditorium

1:00 PM Lunch. Participants go to lunch, either at our Cantine or at a nearby restaurant. Either way, self-pay.
Lunch. Participants go to lunch, either at our Cantine or at a nearby restaurant. Either way, self-pay.
1:00 PM - 2:00 PM
Room: Kantine, Atrium, CSBD 121, 205, 306

2:00 PM Open collaboration time
Open collaboration time
2:00 PM - 3:15 PM
Room: Small auditorium

3:15 PM Coffee and collaboration, Atrium, Seminar Room 2
Coffee and collaboration, Atrium, Seminar Room 2
3:15 PM - 4:00 PM
Room: Atrium, Seminar room 2

4:00 PM Open collaboration time
Open collaboration time
4:00 PM - 5:25 PM
Room: Small auditorium

Choose timezone