Georgia Institute of Technology College of Sciences

Consider any dynamical system with the phase space (set of all states) M. One gets an open dynamical system if M has a subset H (hole) such that any orbit escapes ("disappears") after hitting H. The question in the title naturally appears in dealing with some experiments in physics, in some problems in bioinformatics, in coding theory, etc. However this question was essentially ignored in the dynamical systems theory. It occurred that it has a simple and counter intuitive answer. It also brings about a new characterization of periodic orbits in chaotic dynamical systems. Besides, a duality with Dynamical Networks allows to introduce dynamical characterization of the nodes (or edges) of Networks, which complements such static characterizations as centrality, betweenness, etc. Surprisingly this approach allows to obtain new results about such classical objects as Markov chains and introduce a hierarchy in the set of their states in regard of their ability to absorb or transmit an "information". Most of the results come from a finding that one can make finite (rather than traditional large) time predictions on behavior of dynamical systems even if they do not contain any small parameter. It looks plausible that a variety of problems in dynamical systems, probability, coding, imaging ... could be attacked now. No preliminary knowledge is required. The talk will be accessible to students.

Information encoded in a bar code can be read using a laser scanner or a camera-based scanner. For one-dimensional bar codes, which are in most prevalent use, the information that needs to be extracted are the widths of the black and white bars. The collection of black and white bars may be viewed as a binary one-dimensional image. The signal measured at the scanner amounts to the convolution of the binary image with a smoothing kernel. The challenge is that the smoothing kernel, in addition to the binary image, is also unknown. This presentation will review the technology behind bar code scanning and present several approaches to the decoding problem.

In the 1930's, Tarski introduced his plank problem at a time when the field Discrete Geometry was about to born. It is quite remarkable that Tarski's question and its variants continue to generate interest in the geometric and analytic aspects of coverings by planks in the present time as well. The talk is of a survey type with some new results and with a list of open problems on the discrete geometric side of the plank problem.

Microbes live in environments that are often limiting for growth. They have evolved sophisticated mechanisms to sense changes in environmental parameters such as light and nutrients, after which they swim or crawl into optimal conditions. This phenomenon is known as "chemotaxis" or "phototaxis." Using time-lapse video microscopy we have monitored the movement of phototactic bacteria, i.e., bacteria that move towards light. These movies suggest that single cells are able to move directionally but at the same time, the group dynamics is equally important. Following these observations, in this talk we will present a hierarchy of mathematical models for phototaxis: a stochastic model, an interacting particle system, and a system of PDEs. We will discuss the models, their simulations, and our theorems that show how the system of PDEs can be considered as the limit dynamics of the particle system. Time-permitting, we will overview our recent results on particle, kinetic, and fluid models for phototaxis. This is a joint work with Devaki Bhaya (Department of Plant Biology, Carnegie Institute), Tiago Requeijo (Math, Stanford), and Seung-Yeal Ha (Seoul, Korea).