Past Events

One of the most important techniques provided by modern logic is the use of models to show the consistency of theories. The technique burst onto the scene in the late 19th century, and had its most important early instance in demonstrating the...

Dynamical systems concepts have mostly been developed to understand the behaviour of autonomous, i.e. input-free, nonlinear systems. Even in this case, it is well recognized that such systems can display a wide range of dynamical behaviours...

The closest point method (CPM) is a numerical method that was originally developed to solve partial differential equations (PDEs) on smooth, static surfaces using standard finite difference and interpolation methods. In this talk, we describe a...

In the first part of the talk we discuss a sum-product type result on points near the unit circle that are almost closed under additions. Later we apply the obtained result to establish several universal behavior of the roots of random eigenfunctions...

The dimension of a poset P is the minimum number of total orders whose intersection is P. We prove that the dimension of every poset whose comparability graph has maximum degree $\Delta$ is at most $\Delta log^{1+o(1)} \Delta$. This result improves...

Talk 1: Nilima Nigam- An overview of finite element methods à la Dominik Schoetzau Finite element methods occupy a central and ubiquitous place in much of modern engineering and scientific computing, to the point where they are now treated as 'black...

We will discuss Gradient flow structures in parabolic type PDEs and interface motions. Such structure introduces physical interpretations to time-dependent PDEs in terms of energy dissipation, and allows a weak notion of global-time solutions to...

Let k be a field, A be a finite-dimensional k-algebra (not necessarily commutative, associative or unital), and R be a commutative ring containing k. An R-algebra B is called an R-form of A if there exists a faithfully flat ring extension S/R such...

The celebrated Erdős-Pósa theorem states that every undirected graph that does not admit a family of k vertex-disjoint cycles contains a feedback vertex set (a set of vertices hitting all cycles in the graph) of size O(k log k). After being known for...