Public Lecture by Henry Segerman (Oklahoma State University):

3D Shadows: Casting light on the fourth dimension

Abstract: Our brains have evolved in a three-dimensional environment, and so we are very good at visualising two- and three-dimensional objects. But what about four-dimensional objects? The best we can really do is to look at three-dimensional “shadows”.

David will present a one hour lecture on a couple of card tricks and the mathematical ideas behind them. First he will investigate the De Brujin sequences (which are used in coding theory) and then he will look at what happens mathematically when a deck is shuffled and how we can use this structure to our advantage in a trick.

General meeting of all members of NODES and their PhD students.

Location:

Room TR4, 4th Floor, Herschel Building, Newcastle University

Timetable:

14.00-14.45 Andrew Wade (Durham, Maths): Convex hulls of random walks
14.45-15.30 Tea/Coffee break
15.30-16.15 Victor Khomenko (Newcastle, CS): Canonical Prefixes of Petri Net Unfoldings

Andrew Wade (Durham, Maths): Convex hulls of random walks

Abstract: On each of n unsteady steps, a drunken gardener drops a seed.

David Stewart (Newcastle, Maths): Maximal subalgebras of modular Lie algebras

Time and Location:

16:00 in CM107 (Durham)

Abstract:

The question of classifying maximal subalgebras of Lie algebras goes all the way back to papers of Sophus Lie himself in the 1890s and has a long history from Dynkin onwards.

Maciej Koutny (Newcastle, CS): Synthesis of Petry Nets with Whole-place Operations and Localities

Time and Location:

14:00 in E245 (Durham)

Abstract:

Synthesising systems from behavioural specifications is an attractive way of constructing implementations which are correct-by-design and thus requiring no costly validation efforts. In this talk, systems are modelled by Petri nets and the behavioural specifications are provided in the form of step transition systems, where arcs are labelled by multisets of executed actions.

This event takes place in Durham and is organised by Matthew Johnson and Daniel Paulusma of Durham’s Algorithms and Complexity group (ACiD) together with Jiri Fiala, Jan Kratochvil (Charles University, Prague) and Jozef Siran (Open University). Invited Speakers are

General meeting of all members of NODES and their PhD students.

Location:

Pemberton Building, room PG21

Timetable:

14.00-14.45 Max Gadouleau (Durham, CS): An introduction to the theory of Finite Dynamical Systems 14.45-15.30 Tea/Coffee break 15.30-16.15 Evgenios Kakariadis (Newcastle, Maths): Operator algebras associated with subshifts

Max Gadouleau: An introduction to the theory of Finite Dynamical System

Abstract: We are interested in complex networks of interacting entities (such as genes, neurons, persons, computers, etc.), where each entity has a finitely valued state and a function which updates the value of the state.

Oleg Dolomanov (Durham, OLexSys Ltd): Maths in crystal structure analysis

Time and Location:

13:00 in CM221 (Durham)

Abstract: I will give a short introduction into how and why chemists get to the crystals, how the structures are solved and analysed. It will give some insight into practical use of maths in material sciences.

Peter Jorgensen (Newcastle, Maths): SL_2-tilings, infinite triangulations, and continuous cluster categories

Time and Location:

13:00 in CM221 (Durham)

Abstract:

An SL_2-tilings is an infinite grid of positive integers such that each adjacent 2×2-submatrix has determinant 1. These tilings were introduced by Assem, Reutenauer, and Smith for combinatorial purposes.