Fq\mathbb{F}_q-zeros of sparse trivariate polynomials and toric 3-fold codes

preprint2022arXivOpen access

Abstract

For a given lattice polytope PP in R3\mathbb{R}^3, consider the space LP\mathcal{L}_P of trivariate polynomials over a finite field Fq\mathbb{F}_q, whose Newton polytopes are contained in PP. We give an upper bound for the maximum number of Fq\mathbb{F}_q-zeros of polynomials in LP\mathcal{L}_P in terms of the Minkowski length of PP and qq, the size of the field. Consequently, this produces lower bounds for the minimum distance of toric codes defined by evaluating elements of LP\mathcal{L}_P at the points of the algebraic torus (Fq∗)3(\mathbb{F}_q^*)^3. Our approach is based on understanding factorizations of polynomials in LP\mathcal{L}_P with the largest possible number of non-unit factors. The related combinatorial result that we obtain is a description of Minkowski sums of lattice polytopes contained in PP with the largest possible number of non-trivial summands.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.