Polynomial Methods: Recent Advancements in Combinatorics

✍ Scribed by Thomas Rexford Fleming

• Year: 2022
• Tongue: English
• Leaves: 80
• Series: master thesis at University of Memphis
• Category: Library

✦ Table of Contents

Title
Abstract
Contents
1. Introduction and Preliminary Results
Introduction
Definitions, Notation, and Preliminary Results
2. Nullstellensatz
Hilbert’s Nullstellensatz
Alon’s Combinatorial Nullstellensatz
Ball and Serra’s Punctured Nullstellensatz
3. Simple Combinatorial Proofs
Sumsets
A Nice Result for Graphs
4. Zeilberger-Bressoud q-Dyson Theorem
The Dyson Conjecture and Lagrange Interpolation
The q-Dyson Theorem
5. Zero-Sum Theory
Definitions and Notation
Basic Proofs and Prerequisites
6. Davenport constant of finite abelian p-groups
Map Functors
Combinatorial Identities
The Davenport Constant
Remarks
7. The Chevalley-Warning Theorem and Reiher’s Proof of the Kemnitz Conjecture The Chevalley-Warning Theorem
The Chevalley-Warning Theorem
Reiher’s Proof of the Kemnitz Conjecture
8. Conclusion
References