Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives

DOI10.1017/S0963548318000342MaRDI QIDQ5219319

Olav Geil, Umberto Martínez-Peñas

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Polynomials over finite fields (11T06)

Related Items

Polynomials over structured grids ⋮ Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alon's nullstellensatz for multisets
• More results on the number of zeros of multiplicity at least \(r\)
• Punctured combinatorial Nullstellensätze
• Polynomial multiplicities over finite fields and intersection sets
• Covering the cube by affine hyperplanes
• A probabilistic remark on algebraic program testing
• Multivariate Hermite interpolation by algebraic polynomials: A survey
• Weighted Reed-Muller codes revisited
• Polynomial interpolation in several variables
• Some remarks on multiplicity codes
• A short proof of Combinatorial Nullstellensatz
• List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fundamentals of Error-Correcting Codes
• Footprints or generalized Bezout's theorem
• On Zeros of a Polynomial in a Finite Grid
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
• High-rate codes with sublinear-time decoding

This page was built for publication: Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives