Math Club Kickoff Meeting

09/22 Monday, 4PM - 5PM, 911 Van Vleck Hall

Come enjoy the view from the 9th floor of Van Vleck and eat some free pizza at our kickoff meeting 4:00 - 5:00 Monday 09/22.

Our speaker will be Jordan Ellenberg. Abstract: "I will explain how Zeev Dvir, a graduate student, solved a famous combinatorial geometry problem that vexed Terry Tao, using one drop of algebra."

We will also begin elections for new officers so make sure you're there if you want to be an officer.

Elliptic Curve Cryptography

April 7, 2014

Speaker: Megan Maguire

Abstract: Public-key cryptography refers to cryptographic algorithms that require both a secret key and a public key that are mathematically linked. The public key is used to encrypt and the private key is used to decrypt. Since the public key is public information, the mathematical relationship between the public and private keys needs to be sufficiently difficult to determine without knowledge of the private key. The elliptic curve discrete logarithm problem (ECDLP) provides such a framework for generating public and private keys. We will learn the basics of elliptic curves over finite fields, the elliptic curve discrete logarithm problem, and how they are used in cryptography.

Population Games and Evolutionary Dynamics

April 14, 2014

Speaker: Bill Sandholm (Economics)

Abstract: Population games provide a general model of strategic interactions among large numbers of agents; highway congestion, multilateral externalities, and natural selection are among their many applications.  To model the dynamics of behavior in population games, we introduce revision protocols, which provide explicit stochastic descriptions of how individual agents make decisions.


Subscribe to Math Club RSS