A generalization of Combinatorial Nullstellensatz

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.

Cited by in corpus (12)

• A simple proof of the Zeilberger-Bressoud q-Dyson theorem
• A new approach to constant term identities and Selberg-type integrals
• Finite phylogenetic complexity of $Z_p$ and invariants for $Z_3$
• Sigma Partitioning: Complexity and Random Graphs
• Coloring games and algebraic problems on matroids
• Warning's Second Theorem with Resricted Variables
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the Combinatorial Nullstellensatz
• How to Extend Karolyi and Nagy's BRILLIANT Proof of the Zeilberger-Bressoud q-Dyson Theorem in order to Evaluate ANY Coefficient of the q-Dyson Product
• Computational Aspects of the Combinatorial Nullstellensatz Method
• Restricted Product Sets under Unique Representability
• Additive Combinatorics Using Equivariant Cohomology
• Polynomial Approach to Explicit Formulae for Generalized Binomial Coefficients