In this talk we will don't speak about Joseph-Louis Lagrange (1736-1813) but about Lagrange's reception at the nineteenth Century. "Who read Lagrange at this Times?", "Why and How?", "What does it mean being a mathematician or doing mathematics at this Century" are some of the questions of our conference. We will give some elements of answers and the case Lagrange will be a pretext in order to explain what are doing historians of mathematics: searching archives and – thanks to a methodology – trying to understand, read and write the Past.
Lagrange - mathematical press - complete works - bibliographic index of mathematical sciences (1894-1912) - Liouville - Boussinesq - Terquem[-]

We study repeated bilateral trade where an adaptive σ-smooth adversary generates the valuations of sellers and buyers. We provide a complete characterization of the regret regimes for fixed-price mechanisms under different feedback models in the two cases where the learner can post either the same or different prices to buyers and sellers. We begin by showing that the minimax regret after $T$ rounds is of order $\sqrt{T}$ in the full-feedback scenario. Under partial feedback, any algorithm that has to post the same price to buyers and sellers suffers worst-case linear regret. However, when the learner can post two different prices at each round, we design an algorithm enjoying regret of order $T^{3/4}$ ignoring log factors. We prove that this rate is optimal by presenting a surprising $T^{3/4}$ lower bound, which is the main technical contribution of the paper.[-]

Let $\Omega \subset \mathbb{R}^3$ be a sheared waveguide, i.e., $\Omega$ is built by translating a cross-section (an arbitrary bounded connected open set of $\mathbb{R}^2$ ) in a constant direction along an unbounded spatial curve. Consider $-\Delta_{\Omega}^D$ the Dirichlet Laplacian operator in $\Omega$. Under the condition that the tangent vector of the reference curve admits a finite limit at infinity, we find the essential spectrum of $-\Delta_{\Omega}^D$. After that, we state sufficient conditions that give rise to a non-empty discrete spectrum for $-\Delta_{\Omega}^D$. Finally, in case the cross section translates along a broken line in $\mathbb{R}^3$, we prove that the discrete spectrum of $-\Delta_{\Omega}^D$ is finite, furthermore, we show a particular geometry for $\Omega$ which implies that the total multiplicity of the discrete spectrum is equals 1.[-]

I will discuss a model of interacting particles in continuous space which is reversible with respect to Poisson point measures with constant density. Similar discrete models are known to ”homogenize”, in the sense that the evolution of the particle density can be approximated by the solution to a partial differential equation over large scales. The goal of the talk is to present some results that make this approximation quantitative.
Based on joint works with Arianna Giunti, Chenlin Gu and Maximilian Nitzschner.[-]

Wang's tiles were introduced in the 1960s and have been an inexhaustible source of undecidable problems ever since. They are unit square tiles with colored edges and fixed orientation, which can be placed together provided they share the same color on their common edge. Many decision problems involving Wang tiles follow the same global structure: given a finite set of Wang tiles, is there an algorithm to determine if they tile a particular shape or subset of the infinite grid? If we look for a tiling of the whole grid, this is the domino problem which is known to be undecidable for Z2 and many other groups. In this talk we focus on infinite snake tilings. Originally the infinite snake problem asks is there exists a tiling of a self-avoiding bi-infinite path on the grid Z2. In this talk I present how to expand the scope of domino snake problems to finitely generated groups to understand how the underlying structure affects computability. This is joint work with Nicolás Bitar.[-]

An elegant theorem by J.L. Lions establishes well-posedness of non-autonomous evolutionary problems in Hilbert spaces which are defined by a non-autonomous form. However a regularity problem remained open for many years. We give a survey on positive and negative (partially very recent) results. One of the positive results can be applied to an evolutionary network which has been studied by Dominik Dier and Marjeta Kramar jointly with the speaker. It is governed by non-autonomous Kirchhoff conditions at the vertices of the graph. Also the diffusion coefficients may depend on time. Besides existence and uniqueness long-time behaviour can be described. When conductivity and diffusion coefficients match (so that mass is conserved) the solutions converge to an equilibrium.[-]