Past Events

The talk is about finite connected 4-valent graphs admitting an edge-transitive and vertex-transitive subgroup \(G\) of automorphisms which preserves an orientation of the edges. But I will first talk about the general approach to describing families...

Associating graphs with groups date back to Arthur Cayley. In this lecture, we will discuss about another graph, called co-maximal subgroup graph Γ( G) introduced by Akbari et al. in [1]. The co-maximal subgroup graph Γ( G) of a group G whose...

One of the challenges of the accurate simulation of turbulent flows is that initial data is often incomplete. Data assimilation circumvents this issue by continually incorporating the observed data into the model. A new approach to data assimilation...

Divided power algebras were defined by H. Cartan in 1954 to study the homology of Eilenberg-MacLane spaces. They are commutative algebras endowed, for each integer n, with an additional monomial operation. Over a field of characteristic 0, this...

Abstract: This presentation is dedicated to describing the complete integrability of the Benjamin–Ono (BO) equation on the line when restricted to every N-soliton manifold, denoted by UN . We construct (generalized) action–angle coordinates which...

Abstract:
The Constraint Satisfaction Problem (CSP) provides a general framework for a wide range of combinatorial problems. The simplest way to state the problem is: Given relational structures (say, graphs) G and H, decide if there is a...

Abstract. The mathematical modelling of metastasis is a challenge. The occurrence of metastasis is basically random, and the role of the immune response is not at all clear. In this talk I will discuss two models, one for the spatial spread of...

Molecular interactions lie at the core of biochemistry and biology, and their understanding is crucial to the advancement of biotechnology, therapeutics, and diagnostics. Most existing tools make “ensemble” measurements and report a single result...

Abstract: Random high-density packings of 2x2 tiles on the square lattice Abstract: Consider random configurations of disjoint 2x2 tiles positioned in integer coordinates in a bounded domain in R², where the probability for the appearance of a...

Harary and Sabidussi were the first to study the automorphisms of repeated graphs using the wreath product. Later Hemminger would go on to provide necessary and sufficient conditions for these of repeated automorphisms through the introduction of...