Chip-firing and algebraic combinatorics

author: Caroline Klivans, Brown University
published: July 19, 2019,   recorded: July 2019,   views: 236
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

Chip-firing processes are discrete dynamical systems. A commodity (chips, sand, dollars) is exchanged between sites of a network according to simple local rules. Although governed by local rules, the long-term global behavior of the system reveals unexpected properties, including intricate fractal-like patterns. Early results related chip-firing to classic combinatorial objects such as spanning trees, parking functions, and matroids. In recent years, chip-firing has seen much activity in new directions. Connections have been made, for example, between chip-firing and Coxeter groups, binomial ideals, and Riemann surfaces. In this talk, I will give a broad survey of the theory of chip-firing and its many ties to algebraic combinatorics.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: