A duality based proof of the combinatorial nullstellensatz
zbMATH Open1172.12005arXiv1407.4679MaRDI QIDQ1010901FDOQ1010901
Authors: Omran Kouba
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4679
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Enumerative combinatorics (05A99) Polynomials in general fields (irreducibility, etc.) (12E05) Vector spaces, linear dependence, rank, lineability (15A03)
Cited In (13)
- Combinatorial Nullstellensatz approach to polynomial expansion
- Exploring implications of trace (inversion) formula and Artin algebras in extremal combinatorics
- Proof of the combinatorial nullstellensatz over integral domains, in the spirit of Kouba
- Residues and the combinatorial Nullstellensatz
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- A generalization of combinatorial Nullstellensatz
- The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs.
- Title not available (Why is that?)
- A Refinement of a Mixed Sparse Effective Nullstellensatz
- Combinatorial nullstellensatz modulo prime powers and the parity argument
- A generalized combinatorial nullstellensatz for multisets
- A short proof of combinatorial Nullstellensatz
- Polynomials over structured grids
This page was built for publication: A duality based proof of the combinatorial nullstellensatz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010901)