F_q-zeros of sparse trivariate polynomials and toric 3-fold codes

From MaRDI portal
Publication:5097689

DOI10.1137/21M1436890zbMATH Open1502.14069arXiv2105.10071OpenAlexW4295006338WikidataQ114073995 ScholiaQ114073995MaRDI QIDQ5097689FDOQ5097689


Authors: Kyle P. Meyer, Ivan Soprunov, Evgenia Soprunova Edit this on Wikidata


Publication date: 31 August 2022

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Abstract: For a given lattice polytope P in mathbbR3, consider the space mathcalLP of trivariate polynomials over a finite field mathbbFq, whose Newton polytopes are contained in P. We give an upper bound for the maximum number of mathbbFq-zeros of polynomials in mathcalLP in terms of the Minkowski length of P and q, the size of the field. Consequently, this produces lower bounds for the minimum distance of toric codes defined by evaluating elements of mathcalLP at the points of the algebraic torus (mathbbFq)3. Our approach is based on understanding factorizations of polynomials in mathcalLP 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 P with the largest possible number of non-trivial summands.


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




Recommendations




Cites Work


Cited In (2)

Uses Software





This page was built for publication: \(\mathbb{F}_q\)-zeros of sparse trivariate polynomials and toric 3-fold codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097689)