On the computation of rational solutions of underdetermined systems over a finite field

DOI10.1016/J.JCO.2022.101712MaRDI QIDQ6403103arXivFDO

Authors Nardo Giménez, Guillermo Matera, Mariana Pérez, Melina Privitelli

Publication date 24 June 2022

Analysis of algorithms (68W40) Varieties over finite and local fields (11G25) Rational points (14G05) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15)

Abstract: We design and analyze an algorithm for computing solutions with coefficients in a finite field

m a t h b b F_{q}

of underdetermined systems defined over

m a t h b b F_{q}

. The algorithm is based on reductions to zero-dimensional searches. The searches are performed on "vertical strips", namely parallel linear spaces of suitable dimension in a given direction. Our results show that, on average, less than three searches suffice to obtain a solution of the original system, with a probability of success which grows exponentially with the number of searches. The analysis of our algorithm relies on results on the probability that the solution set (over the algebraic closure of

m a t h b b F_{q}

) of a random system with coefficients in

m a t h b b F_{q}

satisfies certain geometric and algebraic properties which is of independent interest.

This page was built for publication: On the computation of rational solutions of underdetermined systems over a finite field

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