18.11.2025 16:00 Stefan Kober: On Circuit Diameter and Straight Line Complexity
The circuit diameter of a polyhedron is the maximum length (number of steps) of a shortest circuit walk between any two vertices of the polyhedron. Introduced by Borgwardt, Finhold and Hemmecke (SIDMA 2015), it is a relaxation of the combinatorial diameter of a polyhedron. These two notions of diameter lower bound the number of iterations taken by circuit augmentation algorithms and the simplex method respectively for solving linear programs.
Recently, an analogous lower bound for path-following interior point methods was introduced by Allamigeon, Dadush, Loho, Natura and Végh (SICOMP 2025). Termed straight line complexity, it refers to the minimum number of pieces of any piecewise linear curve that traverses a specified neighborhood of the central path.
In this paper, we study the relationship between circuit diameter and straight line complexity.
For a n-dimensional polyhedron P, we show that its circuit diameter is up to a poly(n) factor upper bounded by the straight line complexity of linear programs defined over P. This yields a strongly polynomial circuit diameter bound for polyhedra with at most 2 variables per inequality.
This is joint work with Daniel Dadush and Zhuan Khye Koh.
Quelle
18.11.2025 16:30 Laurent Jacques (UCLouvain): Implicit neural representations: towards a better understanding of their expressivity on the plane and the sphere
Representing and processing data in spherical domains presents unique challenges, primarily due to the curvature of the domain, which complicates the application of classical Euclidean techniques. Implicit neural representations (INRs) have emerged as a promising alternative for high-fidelity data representation; however, to effectively handle spherical domains, these methods must be adapted to the inherent geometry of the sphere to maintain both accuracy and stability. In this context, we propose Herglotz-NET (HNET), a novel INR architecture that employs a harmonic positional encoding based on complex Herglotz mappings. This encoding yields a well-posed representation on the sphere with interpretable and robust spectral properties. Moreover, we present a unified expressivity analysis showing that any spherical-based INR satisfying a mild condition exhibits a predictable spectral expansion that scales with network depth. Our results establish HNET as a scalable and flexible framework for accurate modeling of spherical data. Finally, inspired by the HNET analysis, we propose a common framework to understand the expressivity of the positional encodings used in Euclidean and spherical INRs.
____________________
Invited by Prof. Johannes Maly
Quelle
19.11.2025 12:15 Mahsa Taheri Ganjhobadi (Universität Hamburg): Sparsity and Efficiency in Diffusion Models
Diffusion models are one of the key architectures of generative AI. Their main drawback, however, is the high computational cost. The first part of the talk introduces diffusion models, outlining their main ideas and their role in modern generative AI. The second part of the talk will focus on our recent research showing how the concept of sparsity, well known especially in statistics, can provide a pathway to more efficient diffusion pipelines. Our mathematical guarantees prove that sparsity can reduce the influence of the input dimension on computational complexity to that of a much smaller intrinsic dimension of the data. Our empirical findings further confirm that inducing sparsity can indeed lead to better samples at a lower cost.
Quelle
19.11.2025 16:15 Norbert Mauser: (Semi) Relativistic (Semi) Classical PDE (around) the Self-Consistent Pauli Equation
We present the relativistic quantum physics model hierarchy from Dirac-Maxwell to Vlasov/Euler-Poisson that models fast moving charges and their self-consistent electro-magnetic field. Our main interest is (asymptotic) analysis of these nonlinear time-dependent PDE, with focus on the Pauli-Poisswell/Darwin system which is the consistent model at first/second order in 1/c (c = speed of light) that keeps both relativistic effects "spin" and "magnetism". Emphasis is on the (semi)classicial limit for vanishing Planck constant. We use both WKB methods and Wigner functions where we extend the 1993 results of P. L. Lions & Paul and Markowich & Mauser on the limit from Schrödinger-Poisson to Vlasov-Poisson, with similar subtilities of pure quantum states vs mixed states. In the hope of taming the mathematical complications stemming from the magnetic field, we are interested also in developing "quantum/semiclassical velocity averaging lemmata" building on the 1988 ideas of Golse, Perthame, Sentis and P.L.Lions. This talk aims to explain the models, the new results & ideas of proofs/techniques, as worked out in joint works mainly with Jakob Möller (X) and also Pierre Germain (ICL), Changhe Yang (Caltech), François Golse (X).
Quelle
20.11.2025 16:15 Laura Crosilla (Florence): Weyl’s “constructivism”
Hermann Weyl changed his views on the foundations of mathematics several times, with commentators often distinguishing four different phases. These changes give us precious insights into Weyl’s philosophical positions, but also into the foundations of mathematics more generally.
Notwithstanding Weyl’s evolving views on foundations, there are also significant elements of continuity throughout his philosophical reflection. In this talk, I will focus on a constructive attitude that pervades Weyl’s philosophy of mathematics. One aspect I will elaborate on, are the important connections between Weyl’s constructive attitude and his changing views on quantification and logic.
Quelle