Polynomials over structured grids
From MaRDI portal
Publication:5885196
Combinatorial aspects of commutative algebra (05E40) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials over finite fields (11T06) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Recommendations
Cites work
- scientific article; zbMATH DE number 3402743 (Why is no real title available?)
- scientific article; zbMATH DE number 3049980 (Why is no real title available?)
- A duality based proof of the combinatorial nullstellensatz
- A generalization of combinatorial Nullstellensatz
- A short proof of an identity of Sylvester
- A short proof of combinatorial Nullstellensatz
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Binomial Coefficients Modulo a Prime
- Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives
- Combinatorial Nullstellensatz
- On a Special Class of Polynomials
- On zeros of a polynomial in a finite grid
- Partitions of nonzero elements of a finite field into pairs
- Punctured combinatorial Nullstellensätze
- The Combinatorial Nullstellensätze revisited
- Vandermonde sets and super-Vandermonde sets
Cited in
(4)- On an identity of Sylvester
- On multivariate polynomials with many roots over a finite grid
- Exact integrations of polynomials and symmetric quadrature formulas over arbitrary polyhedral grids
- Repeatedly applying the combinatorial Nullstellensatz for zero-sum grids to Martin Gardner's minimum no-3-in-a-line problem
This page was built for publication: Polynomials over structured grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5885196)