(Back to
the menu - click here.)

** ****MATHEMATICS
COLLOQUIUM****:**

** “Operator theory and applications: a
successful interplay“**

Date: |
Download-files: |
Time: |

Wednesday, 18. March 2015 |
Audio-only-Recording as MP3-File
(smallest possible size):
- Audio.mp3 (ca.31Mb) ============================================ Video-Recording for any system with MP4-support:
- Video.mp4 (ca.322Mb) |
15:15 – 16:25 |

Abstract :

Combinatorics was conceived, and then developed over centuries as a discipline about
finite structures.

In the
modern world, however, its applications increasingly pertain to structures
that, although finite,

are
extremely large: the Internet network, social networks, statistical physics, to
name just a few.

Moreover,
the numerical characteristics researchers are normally interested in are
"continuous" in the sense

that
small perturbations in the structure do not change the output very much.

This makes
it very natural to try to think of the "limit theory" of such objects
by pretending that "very large"

actually
means "infinite". It turns out that this mathematical abstraction is
very useful and instructive and leads

to
unexpected connections with many other things, both in mathematics and computer
science.

Two
complementing approaches to constructing such a theory and applying it
elsewhere are known as

graph
limits and flag algebras, and in our talk we review as much of it as the time
permits.

<<<<<< Denna
sida ändrades, den 15 juni 2017 kl.18:26:36 >>>>>>