Polynomial Methods: Recent Advancements in Combinatorics

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Thomas Rexford Fleming
Series: master thesis at University of Memphis
Year: 2022

Language: English

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