Past Events

We introduce an inexact trust-region method for efficiently solving a class of problems in which the objective is the sum of a smooth, nonconvex function and nonsmooth, convex function. Such objectives are pervasive in the literature, with examples...

It has been known since the 80s, thanks to Conrey and Ghosh, that the average of the square of the Riemann zeta function, summed over the extreme points of zeta up to a height $T$, is $\frac{1}{2} (e^2-5) \log T$ as $T \rightarrow \infty$. This...

Selection acts upon genes tied together on chromosomes. This physical association reduces the efficiency of evolution because, in the absence of sex, alleles must rise and fall together in frequency with the genome in which they are found. In this...

Introduction to knowledge graph with an application in Construction Code Compliance with BIM and Linked Building Data Abstract: Knowledge graph and ontology are powerful mathematical constructs that has a lot of applications. This presentation begins...

A phase transition is a phenomenon in physics, chemistry, and other related fields where the macroscopic behavior of a system changes qualitatively when the tuning parameter (such as temperature) that governs local interactions is varied by a small...

Abstract: Invariant random subgroups are conjugation invariant measures on the space of subgroups of a given group G. Their study provides a fertile playground for the interaction of algebra, geometry, probability and ergodic theory. On one hand...

It is a well-known result of Harish-Chandra that most invariant distributions on real and p-adic reductive groups (e.g., Fourier transforms of orbital integrals, and characters of representations) are represented by locally integrable functions on...

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...

School timetabling is a complex problem in combinatorial optimization, requiring the best possible assignment of course sections to teachers, timeslots, and classrooms. For educational institutions, the Master Timetable dictates to every single...