Combinatorial nullstellensatz modulo prime powers and the parity argument

zbMath1403.11020arXiv1402.4422MaRDI QIDQ490257

Yong-Cai Geng, Sumit K. Garg

Publication date: 22 January 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.4422

zbMATH Keywords

combinatorial nullstellensatzalgebraic combinatoricspolynomial argument

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Related Items (2)

TFNP: An Update ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Regular subgraphs of almost regular graphs
• Chevalley's theorem with restricted variables
• On total functions, existence theorems and computational complexity
• A note on polynomials and \(f\)-factors of graphs
• On the complexity of the parity argument and other inefficient proofs of existence
• A note on degree-constrained subgraphs
• A combinatorial problem on finite Abelian groups. I
• Integer-Valued Polynomials
• Combinatorial Nullstellensatz

This page was built for publication: Combinatorial nullstellensatz modulo prime powers and the parity argument