A generalization of Combinatorial Nullstellensatz
Micha{\l} Laso\'n
TL;DR
This paper extends the Combinatorial Nullstellensatz by weakening its assumptions and demonstrates its applicability in new scenarios where the original theorem is insufficient.
Contribution
It introduces a generalized version of Combinatorial Nullstellensatz with relaxed conditions and shows its usefulness in previously inaccessible cases.
Findings
Extended Nullstellensatz with weaker assumptions
Application in new combinatorial problems
Broader applicability of the theorem
Abstract
In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situation where the original theorem does not seem to work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Graph theory and applications · Advanced Combinatorial Mathematics