Fachbereich Mathematik und Statistik |
Universität Konstanz |

Schwerpunkt Reelle Geometrie und Algebra > Prof. Dr. S. Kuhlmann > Mitarbeiter > Dr. Maria Infusino |

- a lecture series aimed to present mathematical results/biographies of female mathematicians and/or their experience in academia.
- a meeting point for female mathematicians which intends to promote them in their paths in studies and career.
- a counseling by women for women.

If you are interested in knowing more about the KWIM project and its activities, please download the

**Carolin Antos-Kuby**(Universität Konstanz, Germany): True, false, independent: How the Continuum Hypothesis can be solved (or not).

Tuesday December 12th 2017, 17:00 - 18:15, Room F426

**Abstract.**

What is the size of the set of real numbers? The search for the answer to this question led the way to the development of one of the most productive and powerful techniques in modern set theory - the forcing technique. It was developed to find an answer to the question of the truth of the Continuum Hypothesis (CH), a statement that says that there is no infinite cardinality between that of the natural and the real numbers. The answer to this question is, in a nutshell: Some people think it is true, some think it is false, all know that it is independent and nowadays one could argue that it is all three at once.

To illustrate this answer I will focus on different models of set theory and how to construct them in a way that renders CH true or false. We will look at the constructible universe L that was build by Kurt Gödel and give an introduction to the forcing method. Forcing was developed to decide CH, but it is actually a general technique that allows one to build models suited to a vast varieties of set theoretic tasks. We will give an overview of the technical set-up of forcing and detail on how it can be used to build a model where CH is false. We conclude by considering the behavior of CH over a multitude of set-theoretic models created by forcing that decide CH in very different ways.**Julia Lieb**(Universität Würzburg, Germany): MDP Faltungscodes

Tuesday February 13th 2018, 17:00 - 18:15, Room F426

**Abstract.**

Das Prinzip fehlerkorrigierender Codes ist es, an eine Nachricht (Folge von Elementen eines endlichen Körpers) vor dem Senden Redundanz anzufügen, um die ursprüngliche Nachricht wieder rekonstruieren zu können, wenn beim Senden Fehler oder Informationsverlust auftreten. Hierbei ist der Minimalabstand zwischen Codewörtern entscheidend für die Anzahl der Fehler, die korrigiert werden können. Das Thema dieses Vortrages sind MDP Faltungscodes. Diese besitzen die Eigenschaft, dass der sog. Spaltenabstand für so lange wie möglich so schnell wie möglich wächst. Der Vortrag beginnt mit einer kurzen Einführung zur Kodierungstheorie und zu MDP Faltungscodes. Darüber hinaus werden reversible und vollständige MDP Faltungscodes betrachtet, die vorteilhafte Zusatzeigenschaften besitzen. Es wird die Existenz dieser Codes für alle Codeparameter gezeigt. Danach werden allgemeine Konstruktionstechniken vorgestellt, die voraussetzen, dass die Größe des zugrundeliegenden endlichen Körpers hinreichend groß ist. Schließlich wird für spezielle Codeparameter die Frage untersucht, welche Größe des Körpers notwendig ist, damit es möglich ist, einen MDP Faltungscode zu konstruieren.**Anna-Lena Horlemann-Trautmann**(University of St. Gallen, Switzerland): TBA

Tuesday April 24th 2018, 17:00 - 18:15, Room F426

**Giulia Fabrini**(Universität Konstanz, Germany): TBA

Tuesday May 15th 2018, 17:00 - 18:15, Room F426

**Sabine Jansen**(LMU München, Germany): TBA

Tuesday May 29th 2018, 17:00 - 18:15, Room F426

**Karin Baur**(Universität Graz, Austria): TBA

Tuesday June 12th 2018, 17:00 - 18:15, Room F426

**Constanza Rojas-Molina**(Rheinische Friedrich-Wilhelms-Universität Bonn, Germany): TBA

Tuesday July 3rd 2018, 17:00 - 18:15, Room F426

**Mickaël Matusinski**(Universiteé Bordeaux, France): Sofia Kovalevskaya : mathematician, writer, revolutionnary.

Tuesday January 17th 2016, 17:00 - 18:15, Room D432

**Abstract.**

Sofia Kovalevskaya is a prominent historical personality. She used to be a full leading mathematician of her time, at an international level, thanks to her rich and varied works that are taught everywhere and continue to inspire us. She was also - and not less - a militant socialist and feminist, and a committed novelist, emblematic figure of the Russian - and even European - intelligentsia rebeling during an era of historical upheavals. We will address these different aspects of her life.**Diana Conache**(TU München, Germany): Equilibrium states of interacting particle systems.

Tuesday February 9th 2016, 17:00 - 18:15, Room G300

**Abstract.**

Interacting particle systems are an increasingly popular field of study, due to applications not only in physics, but also in biology, ecology, economy, sociology, etc. Their mathematical modelling involves a beautiful mixture of techniques from analysis and probability alike. In this talk, I will focus on describing their behaviour in equilibrium and answer questions like: Can the system reach equilibrium? Is the equilibrium state unique? We will review some of the most important results in the literature and present some recent ones as well, focusing on the case of systems in the continuum.**Jihad A. Titi**(Universität Konstanz, Germany):**Matrix methods for an efficient computation of the tensorial Bernstein coefficients.**

Tuesday May 31st 2016, 17:00 - 18:15, Room F426

**Abstract.**

Solving optimization problems is of paramount importance in many real-life and scientific problems; polynomial global optimization problems form a significant part of them. Considered problems are unconstrained and constrained optimization problems over boxes. One approach for their solution is based on the expansion of a polynomial into Bernstein polynomials of the objective function and the constraints polynomials, the so-called*Bernstein form*. The coefficients (*Bernstein coefficients*) can be rearranged in a multi-dimensional array, the so-called*Bernstein patch*. From these coefficients we get bounds for the range of the objective function and the constraints over a box. We can improve the enclosure for the range of the polynomial by elevating the degree of the Bernstein expansion or by subdivisions of the region. In this talk, multivariate polynomials in the Bernstein basis over a box (tensorial Bernstein form) will be considered. Two new matrix methods for the computation of the polynomial coefficients with respect to the Bernstein basis will be presented and compared with existing methods. Also, matrix methods for the calculation of the Bernstein coefficients over subboxes generated by subdivision of the original box will be introduced.**Lyudmila Grigoryeva**(Universität Konstanz, Germany): Time-delay differential equations in machine learning.

Tuesday June 21st 2016, 17:00 - 18:15, Room F426

**Abstract.**

Reservoir computing is a recently introduced brain-inspired machine learning paradigm. We focus on a specific type of reservoir computers that is based on the use of time-delay differential equations. We call them time-delay reservoirs (TDRs). TDRs have been physically implemented using optical and electronic systems showing unprecedented data processing rates. We study the performance of TDRs in different working regimes and establish their functional link with the reservoir parameters. We focus on the stability analysis of the underlying time-delay differential equation and propose an approximating model that allows us to explore various properties of the device and to choose the optimal reservoir architecture, thus replacing tedious and time consuming parameter scannings used so far in the literature. In the proposed framework we tackle standard machine learning tasks of forecasting and reconstruction of stochastic time series. The discussed novel machine learning technique shows excellent potential in high-dimensional classification problems.**KWIM Double Lecture**: Tuesday July 5th 2016, 16:00 - 18:30, Room R512

- 16:00-17:00
**Raman Parimala**(Emory University, Atlanta, USA):**Hasse principle over function fields**

**Abstract.**

The classical theorem of Hasse and Minkowski asserts that a quadratic form over the field of rational numbers represents zero nontrivially provided that it represents zero nontrivially over completions at all its places. Analogous questions for function fields have interesting consequences. We shall discuss the analogy between the field of rational numbers and function fields of p-adic curves in the context of Hasse principles for quadratic forms and more general structures. - 17:15-18:15
**Charu Goel**(Indian Institute of Science Education and Research, Mohali, India):**Cones in and around the sum of squares cone**

**Abstract.**

In this talk we will first introduce cones of sums of squares of k-term forms, which are more restrictive than the sums of squares cone. We then present some relevant worked out examples to show how these cones look like and relate to each other. Finally, we will describe cones of forms, which correspond to existence of a Gram matrix that is non-negative on varieties containing the Veronese variety, and explain how this gives us a nice filtration of intermediate cones between the sums of squares cone and the cone of positive semidefinite forms.

- 16:00-17:00
**Frauke Liers**(Universität Erlangen-Nürnberg, Germany):**Robust solution approaches for optimization under uncertainty: applications to air traffic management problems**

Tuesday November 15th 2016, 17:00 - 18:15, Room F426

**Abstract.**

Real applications often face uncertainty in the input parameters. Robust optimization takes these uncertainties into account already in the mathematical model. The task is to determine solutions that are feasible for all considered realizations of the uncertain parameters, and among them one with best guaranteed solution value. In this talk, we focus on efficient planning of runway utilization under uncertainty as this is one of the main challenges in air-traffic management. We present optimization approaches for runway scheduling as well as for the pre-tactical planning phase. Mathematically, this leads to NP-hard optimization problems in which b-matchings with side constraints need to be determined. We present structural insights as well as effective exact solution algorithms. In reality, uncertainty and inaccuracy almost always lead to deviations from the actual schedule. We present robust optimization approaches together with computational results that show their effectiveness. These approaches are integrated and validated within simulation procedures. It is shown that the models that the robust models yield considerably more stable plans than the approaches that ignore uncertainties, at the price of limited increase in delay only.**Maria Valentino**(King's College London, United Kingdom):**On the diagonalizability of the Atkin U-operator for Drinfeld cusp forms**

Tuesday November 29th 2016, 17:00 - 18:15, Room F426

**Abstract.**

In this talk we shall begin with an introduction to the world of Drinfeld modular forms, which are the analogous of modular forms in the realm of function fields in positive characteristic. We shall then address the problem of the diagonalizability of the function field analogous of the Atkin U-operator. This is a joint work with A. Bandini (University of Parma).**Mima Stanojkovski**(Leiden University, Netherlands):**Intense automorphisms of groups**

Tuesday January 24th 2017, 17:00 - 18:15, Room F426

**Abstract.**

Let G be a finite group. A good strategy for understanding the structure of G is that of studying its group of symmetries, Aut(G). Let Int(G) be the subgroup of Aut(G) consisting of those automorphisms (called 'intense') that send each subgroup of G to a conjugate. Intense automorphisms arise naturally as solutions to a problem coming from Galois cohomology, still they give rise to a greatly entertaining theory on its own. We will discuss the case of groups of prime power order and we will see that, if G has prime power order but Int(G) does not, then the structure of G is (surprisingly!) almost completely determined by its nilpotency class.**Sabrina Ouazzani**(Université Paris-Est Créteil, France):**A mixture of computability and ordinals, the infinite time Turing machines**

Tuesday April 25th 2017, 17:00 - 18:15, Room F426

**Abstract.**

In this talk, we present infinite time Turing machines (ITTM), from a general introduction on computability and ordinals to the original definition of this transfinite model of computation. We will also present algorithmic techniques that allow to highlight some properties of the ITTM-computable ordinals. In particular, we will introduce gaps in ordinal computation times, that is to say, ordinal times at which no infinite time program halts.**Martina Juhnke-Kubitzke**(Universität Osnabrück, Germany):**Face numbers of (balanced) simplicial polytopes and manifolds**

Tuesday May 16th 2017, 17:00 - 18:15, Room F426

**Abstract.**

Given a closed manifold M together with a triangulation Δ, a classical question in geometric combinatorics and discrete geometry asks for the smallest number of vertices Δ can possibly have. Fixing the number of vertices, one can even wonder, what the smallest/largest number of edges are. More generally, a classical problem is to characterize all possible face numbers of Δ. The first part of this talk will provide a brief introduction into the study of face numbers of simplicial polytopes and manifolds and survey some of the most classical and important results. In the second part, we will consider so-called balanced triangulations, where a triangulation is balanced if and only if there exists a coloring of its vertices without monochromatic edges. In particular, we will be interested in lower bounds for the face numbers of this type of triangulations. This is joint work with Satoshi Murai, Isabella Novik and Connor Sawaske.**Deirdre Haskell**(McMaster University, Canada):**Using model theory to find upper bounds on VC density**

Tuesday May 30th 2017, 17:00 - 18:15, Room F426

**Abstract.**

The VC dimension of a collection of sets is a concept used in probability and learning theory. It is closely related to the model-theoretic concept of the independence property. In this talk, I will illustrate these concepts in various examples, and show how the model-theoretic approach can give some bounds on VC density. I will also talk a bit about my own experience as a woman in mathematics, and the place of affirmative action in hiring.**Tobias Kuna**(University of Reading, UK):**Response theory for non-smooth observables and women in mathematics in the UK**

Tuesday June 27th 2017, 17:00 - 18:15, Room F426

**Abstract.**

First, I will describe the situation of women in mathematics in UK with a particular focus on the national Athena SWAN (Scientific Women’s Academic Network) Charter and its effects. Then I will present a joint work with Viviane Baladi, who is a leading expert in the functional approach to statistical properties of dynamical systems. We studied together with Valerio Lucarini the change of the SRB measure of an Axiom A system with respect to the perturbation of the dynamic. The novelty is that we consider discontinuous observables which lead to linear or fractional response. The question is motivated by extreme value theory for dynamical systems and the associated over-threshold events.**Malabika Pramanik**(University of British Columbia, Canada):**On Lebesgue-improving measures**

Tuesday July 4th 2017, 17:00 - 18:15, Room F426

**Abstract.**

We know how to measure smoothness of a function (for example: how many times is it differentiable), but how does one measure the smoothness of a measure? This talk, intended for a general mathematical audience, will be devoted to a survey of this topic, with many examples. I will also talk a bit about my career path and some recent initiatives concerning women in mathematics that I have been involved with.**Alev Topuzoglu**(Sabanci University, Turkey)**On permutation polynomials over finite fields**

Tuesday July 18th 2017, 17:00 - 18:15, Room F426

**Abstract.**

Permutation polynomials over finite fields have gained considerable attention in the last decades, due to their vast applications, especially in combinatorics, coding and cryptography. In order to meet the specific requirements of individual applications, methods of construction of special types of permutations and/or new ways of classifying them are needed.

Carlitz rank of a permutation polynomial is a simple concept that was introduced in the last decade, and classifying permutations with respect to their Carlitz ranks was shown to have some significant advantages. This talk is intended for a general mathematical audience, and aims to present a variety of results concerning this notion. Based on my research experiences, I will also include some suggestions for students and young researchers.

__NEW!__**Opening of the exhibition "Women of Mathematics throughout Europe. A gallery of portraits." at Uni Konstanz**: October 19, 2017, Konstanz, Germany.-
**Participation in the Opening of the exhibition "Women of Mathematics throughout Europe. A gallery of portraits." at the ÖMG - DMV 2017**: September 11, 2017, Salzburg, Germany. For more details on this event, please download the report of the exhibition opening. **Focus group discussion at German chapter of the European Women in Mathematics**entitled**"Women in Mathematics: challenges and opportunities in Germany"**: June 9th, 2017, University of Bielefeld, Germany.**Fishbowl discussion at MFO Workshop 1710**entitled**"Real nonnegative representations for women in mathematics"**: March 8th 2017, MFO, Oberwolfach, Germany.
For more details on this event, please download the report of the discussion.
**Panel discussion at IWOTA 2016: "Women in Mathematics"**: July 19th 2016, Washington University in St. Louis, USA. For more details about the overview on the situation of*Women in Mathematics in Germany*presented at this event, please download the WIM in Germany-slides and the WIM in Germany-report.-
**Workshop "Women in Probability"**: June 3-4, 2016, TU München, Germany. -
**Meeting with the Reading Equality and Diversity Committee**: November 27th, 2015, University of Reading, UK

Last update: 14.02.2018