In this talk I will insult your intelligence by showing a
non-original proof of the Central Limit Theorem, with
not-particularly-good error bounds. However, the proof is very
simple and flexible, allowing generalizations to multidimensional
and...
In this talk I will overview two very different kinds of random
simplicial complex, both of which could be considered
higher-dimensional generalizations of the Erdos-Renyi random graph,
and discuss what is known and not known about the expected...
We give a pseudorandom generator, with seed length $O(log n)$,
for $CC0[p]$, the class of constant-depth circuits with unbounded
fan-in $MODp$ gates, for prime $p$. More accurately, the seed
length of our generator is $O(log n)$ for any constant...
I will describe the proof of the following surprising result:
the typical billiard paths form the family of the most uniformly
distributed curves in the unit square. I will justify this vague
claim with a precise statement. As a byproduct, we...
I will talk about the computational complexity of computing the
noncommutative determinant. In contrast to the case of commutative
algebras, we know of (virtually) no efficient algorithms to compute
the determinant over non-commutative domains...
Finding the longest increasing subsequence (LIS) is a classic
algorithmic problem. Simple $O(n log n)$ algorithms, based on
dynamic programming, are known for solving this problem exactly on
arrays of length $n$.
The early work of Condorcet in the eighteenth century, and that
of Arrow and others in the twentieth century, revealed the complex
and interesting mathematical problems that arise in the theory of
social choice. In this lecture, Noga Alon, Visiting...
