# Scientific

## Random Walk in Random Scenery

In this talk we consider a random walk on a randomly colored lattice and ask what are the properties of the sequence of colors encountered by the walk.

## Phase Transitions for Interacting Diffusions

In the present talk we focus on the ergodic behavior of systems of interacting diffusions.

## Lectures on Integer Partitions

What I’d like to do in these lectures is to give, first, a review of the classical theory of integer partitions, and then to discuss some more recent developments. The latter will revolve around a chain of six papers, published since 1980, by Garsia-Milne, Jeff Remmel, Basil Gordon, Kathy O’Hara, and myself. In these papers what emerges is a unified and automated method for dealing with a large class of partition identities.

By a partition identity I will mean a theorem of the form “there are the same number of partitions of n such that . . . as there are such that . . ..” A great deal of human ingenuity has been expended on finding bijective and analytical proofs of such identities over the years, but, as with some other parts of mathematics, computers can now produce these bijections by themselves. What’s more, it seems that what the computers discover are the very same bijections that we humans had so proudly been discovering for all of those years.

These lectures are intended to be accessible to graduate students in mathematics and computer science.

## Torsion invariants of 3-manifolds

This series of six lectures is intended for a general audience. The aim of the lectures is to survey the theory of torsions of 3-dimensional manifolds. The torsions were introduced by Kurt Reidemeister in 1935 to give a topological classification of lens spaces. Recent interest in torsions is due to their connections with the Seiberg-Witten invariants of 4-manifolds and the Floer-type homology of 3-manifolds. The lectures will cover the above topics.

## Algebraic Z^d-actions

- Read more about Algebraic Z^d-actions
- 4847 reads

## Entropy and Orbit Equivalence

In these notes we first offer an overview of two core areas in the dynamics of probability measure preserving systems, the Kolmogorov-Sinai theory of entropy and the theory of orbit equivalence. Entropy is a nontrivial invariant that, said simply, measures the exponential growth rate of the number of orbits in a dynamical system, a very rough measure of the complexity of the orbit structure. On the other hand, the core theorem of the orbit theory of these systems, due to Henry Dye, says that any two free and ergodic systems are orbit equivalent, that is to say can be regarded as sitting on the same set of orbits. The goal we set out to reach now is to explain and understand the seeming conflict between these two notions.

## On Hilbert's Tenth Problem

Dr. Matiyasevich is a distinguished logician and mathematician based at the Steklov Institute of Mathematics at St. Petersburg. He is known for his outstanding work in logic, number theory and the theory of algorithms.

At the International Congress of Mathematicians in Paris in 1900 David Hilbert presented a famous list of 23 unsolved problems. It was 70 years later before a solution was found for Hilbert's tenth problem. Matiyasevich, at the young age of 22, acheived international fame for his solution.

- Read more about On Hilbert's Tenth Problem
- 6335 reads

## Projective Modules in Classical and Quantum Functional Analysis

Homological theory of the “algebras in analysis” exists in at least three different versions. First of all, there is the homological theory of Banach and more general locally convex algebras. This is about 40 years old. However, in the last decade of the previous century, a “homological section” appeared in a new branch of analysis, the so-called quantized functional analysis or, more prosaically, the theory of operator spaces. One of principal features of this theory, as is now widely realized, is the existence of different approaches to the proper quantum version of a bounded bilinear operator. In fact, two such versions are now thought to be most important; each of them has its own relevant tensor product with an appropriate universal property. Accordingly, there are two principal versions of quantized algebras and quantized modules, and this leads to two principal versions of quantized homology.

Thus we have now, in the first decade of the 21st century, three species of topological homology: the traditional (or “classical”) one, and two “quantized” ones.

In these lectures, we shall restrict ourselves by studying, in the framework of these three theories, the fundamental concept of a projective module. This concept is “primus inter pares” among the three recognized pillars of the science of homology: projectivity, injectivity, and flatness. It is this notion that is the cornerstone for every sufficiently developed homological theory, let it be in algebra, topology, or, as in these notes, in functional analysis.

Our initial definitions of projectivity do not go far away from their prototypes in abstract algebra. However, the principal results concern essentially functional-analytic objects. As we shall see, they have, as a rule, no purely algebraic analogues. Moreover,

some phenomena are strikingly different from what algebraists could expect, based on their experience.

## On the Chromatic Number of Graphs and Set Systems

During this series of lectures, we are talking about infinite graphs and set systems, so this will be infinite combinatorics. This subject was initiated by Paul Erdös in the late 1940’s.

I will try to show in these lectures how it becomes an important part of modern set theory, first serving as a test case for modern tools, but also influencing their developments.

In the first few of the lectures, I will pretend that I am talking about a joint work of István Juhász, Saharon Shelah and myself [23].

The actual highly technical result of this paper that appeared in the **Fundamenta** in 2000 will only be stated in the second or the third part of these lectures. Meanwhile I will introduce the main concepts and state—--and sometimes prove—--simple results about them.