Combinatorial Nullstellensatz

Authors:
Noga Alon
Affiliations:
Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel and Institute for Advanced Study, Princeton, NJ 08540, USA (e-mail: noga@mat ...
Venue:
Combinatorics, Probability and Computing
Year:
1999

Citing 22
Cited 44

Regular subgraphs of dense graphs

Combinatorica
How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On the penrose number of cubic diagrams

Discrete Mathematics - Graph colouring and variations
Additive bases of vector spaces over prime fields

Journal of Combinatorial Theory Series A
A solution to a colouring problem of P. Erdős

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
On three zero-sum Ramsey-type problem

Journal of Graph Theory
Covering the cube by affine hyperplanes

European Journal of Combinatorics
Group connectivity of graphs: a nonhomogeneous analogue of nowhere-zero flow properties

Journal of Combinatorial Theory Series B
Restricted colorings of graphs

Surveys in combinatorics, 1993
Polynomials in finite geometries and combinatorics

Surveys in combinatorics, 1993
Stable sets and polynomials

Proceedings of the first Malta conference on Graphs and combinatorics
Dense graphs without 3-regular subgraphs

Journal of Combinatorial Theory Series B
The list chromatic index of a bipartite multigraph

Journal of Combinatorial Theory Series B
Asymptotically good list-colorings

Journal of Combinatorial Theory Series A
Tools from linear algebra

Handbook of combinatorics (vol. 2)
Tools from higher algebra

Handbook of combinatorics (vol. 2)
Lower Bounds on Representing Boolean Functions as Polynomials in $z_{m}$

SIAM Journal on Discrete Mathematics
Sums in the grid

Discrete Mathematics
A note on graph colorings and graph polynomials

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs

Combinatorics, Probability and Computing
Extremal Graph Theory

Extremal Graph Theory

A lower bound for |{a + b: a ∈ A, b ∈ B, P(a,b) ≠ 0}|

Journal of Combinatorial Theory Series A
On 2-coloring certain k-uniform hypergraphs

Journal of Combinatorial Theory Series A
Zero-sum problems and coverings by proper cosets

European Journal of Combinatorics
Polynomials that Vanish on Distinct $n$th Roots of Unity

Combinatorics, Probability and Computing
Distinct Sums Modulo n and Tree Embeddings

Combinatorics, Probability and Computing
On Snevily's conjecture and restricted sumsets

Journal of Combinatorial Theory Series A
Simple PCPs with poly-log rate and query complexity

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pair dominating graphs

European Journal of Combinatorics
Feasible Schedules for Rotating Transmissions

Combinatorics, Probability and Computing
Edge Colouring with Delays

Combinatorics, Probability and Computing
Parity, eulerian subgraphs and the Tutte polynomial

Journal of Combinatorial Theory Series B
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
2-Synchronizing Words

Language and Automata Theory and Applications
Note: Restricted set addition: The exceptional case of the Erdős--Heilbronn conjecture

Journal of Combinatorial Theory Series A
Algebraic properties of modulo q complete ℓ-wide families

Combinatorics, Probability and Computing
Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz

Combinatorics, Probability and Computing
On a conjecture of Graham and Häggkvist with the polynomial method

European Journal of Combinatorics
Lucky labelings of graphs

Information Processing Letters
Note: A new extension of the Erdős--Heilbronn conjecture

Journal of Combinatorial Theory Series A
Addition of sets via symmetric polynomials - A polynomial method

European Journal of Combinatorics
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in

Proceedings of the forty-second ACM symposium on Theory of computing
Enumeration of non-crossing pairings on bit strings

Journal of Combinatorial Theory Series A
Arithmetic Circuits: A survey of recent results and open questions

Foundations and Trends® in Theoretical Computer Science
Black-box identity testing of depth-4 multilinear circuits

Proceedings of the forty-third annual ACM symposium on Theory of computing
Some combinatorial applications of Gröbner bases

CAI'11 Proceedings of the 4th international conference on Algebraic informatics
On two generalizations of the Alon-Tarsi polynomial method

Journal of Combinatorial Theory Series B
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz

Journal of Symbolic Computation
Linear extension of the Erdős-Heilbronn conjecture

Journal of Combinatorial Theory Series A
On the modular sumset partition problem

European Journal of Combinatorics
Permutations, hyperplanes and polynomials over finite fields

Finite Fields and Their Applications
On value sets of polynomials over a field

Finite Fields and Their Applications
On the subset sum problem over finite fields

Finite Fields and Their Applications
Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields

Finite Fields and Their Applications
Value sets of polynomials and the Cauchy Davenport theorem

Finite Fields and Their Applications
Antimagic labelling of vertex weighted graphs

Journal of Graph Theory
Total weight choosability of Cartesian product of graphs

European Journal of Combinatorics
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing

Information Processing Letters
Parity and strong parity edge-colorings of graphs

Journal of Combinatorial Optimization
An algebraic characterization of rainbow connectivity

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Algebraic independence and blackbox identity testing

Information and Computation
Essential positive covers of the cube

Journal of Combinatorial Theory Series A
On the exterior algebra method applied to restricted set addition

European Journal of Combinatorics
Testers and their applications

Proceedings of the 5th conference on Innovations in theoretical computer science
Affine cartesian codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.