Gyula Karolyi (University of Queensland)
Some applications of the Combinatorial Nullstellensatz
The Combinatorial Nullstellensatz, introduced by Noga Alon in his 1999 seminal paper, effectively describes the structure of polynomials that vanish on a Cartesian product. Due to this effectiveness, it has a wide range of applications from finite geometry to combinatorial arithmetic to graph colourings. A recent variant even connects to statistical mechanics and representation theory by allowing us to turn often difficult constant term evaluations into simple combinatorial problems. In this talk, very elementary in nature, I will illustrate the methodology through some examples.
---------------------------------------------------------------------------------------
We will take the speaker to lunch after the talk.
See the Algebra Seminar web page for information about other seminars in the series.
John Enyang John.Enyang@sydney.edu.au