Past Events

In this talk we will discuss a combinatorial approach to studying the geometry of the moduli space of Langlands parameters for GLn. We will first discuss several connections between the study of partitions and the study of nilpotent conjugacy classes...

A challenge in descriptive complexity is to identify logics with low complexity that simultaneously express both fundamental reachability properties and counting properties on unordered structures. In this talk, we introduce a family of logics that...

A subset of the integers P is called predictive if for all zero-entropy processes X_i; i in Z, X_0 can be determined by X_i; i in P. The classical formula for entropy shows that the set of natural numbers forms a predictive set. In joint work with...

We study the existence and regularity of harmonic and biharmonic almost complex structures. Harmonic almost complex structures were introduced by C. Wood in 1990s. Since then there are considerate interest. For harmonic almost complex structure, we...

We consider a random walk on the complete graph. The walk experiences competing self-repulsion and self-attraction, as well as a variable length. Variation of the parameters governing the self-attraction and the variable length leads to a rich phase...

A group is said to be torsion-free if it has no elements of finite order. An example is the group, under composition, of self-homeomorphisms (continuous maps with continuous inverses) of the interval I = [0, 1] fixed on the boundary {0, 1}. In fact...

Epithelial cells organize themselves into tubes for the necessary functions of gas and nutrient transport, and the production and secretion of hormones and enzymes. Such tubes result from the organization and collective motion of a flat sheet of...

In this talk I will introduce the quantum phase-estimation problem as well as the iterative algorithm by Kitaev that is commonly used to solve it. I show how Kitaev's algorithm can be modified to obtain an asymptotically minimal sampling complexity...

Let omega(n) denote the number of distinct prime divisors of n. Let W(m) be a random integer chosen uniformly from the set of natural numbers less than or equal to m. Let X(m) be omega(W(m)). The celebrated Erdos-Kac theorem asserts that if the...

Many results in extremal graph theory can be formulated as inequalities on graph densities. While many inequalities are known,many more are conjectured. A standard tool to establish an inequality is to write the expression whose nonnegativity needs...