Past Events

The Polya group of a number field K is a specific subgroup of the ideal class group Cl(K) of K, generated by all classes of Ostrowski ideals of K. In this talk, I will discuss the equality Po(K)=Cl(K) in two directions. First, we will see this...

Tensors are higher-dimensional generalisations of matrices, and likewise the main notion of complexity on matrices - their rank - may be extended to tensors. Unlike in the matrix case however, there is no single canonical notion of rank for tensors...

TBA

I will provide an introduction to simplicial sets, which will serve as foundation for the rest of the lecture series. We will discuss examples and a few constructions, such as the function complex and geometric realization.

For every finite group H and every finite H-module A, we determine the subgroup of negligible classes in H^2(H,A), in the sense of Serre, over fields with enough roots of unity. As a consequence, we show that for every odd prime p and every field F...

We will explore how a Fourier optimization framework may be used to study two classical problems in number theory involving Dirichlet characters: The problem of estimating the least character non-residue; and the problem of estimating the least prime...

The challenge of solving energy distribution grid planning problems, including operation and expansion planning, stems from their combinatorial nature and the vast solution space. Several models and techniques have been proposed in the literature to...

The classical McKay correspondence shows that there is a bijection between irreducible representations of finite subgroups $G$ of $\mathrm{SL}(2,\mathbb{C})$ and the exceptional divisors of the minimal resolution of the singularity $\mathbb{C}^2/G$...

In 1966, Tate proposed the Artin–Tate conjectures, which expresses special values of zeta function associated to surfaces over finite fields. Conditional on the Tate conjecture, Milne–Ramachandran formulated and proved similar conjectures for smooth...

A classical problem in combinatorial geometry, posed by Erdős in 1946, asks to determine the maximum number of unit segments in a set of n points in the plane. Since then a great variety of extremal problems in finite planar point sets have been...