Abstract

Let Fq[t] denote the polynomial ring over the finite field Fq, and let SN denote the subset of Fq[t] containing all polynomials of degree strictly less than N . For a matrix Y = ` ai,j ∈ FR×S q satisfying ai,1 + · · ·+ai,S = 0 (1 ≤ i ≤ R), let DY (SN ) denote the maximal cardinality of a set A ⊆ SN for which the equations ai,1x1 + · · ·+ai,SxS = 0 (1 ≤ i ≤ R) are never satisfied simultaneously by distinct elements x1, . . . , xS ∈ A. Under certain assumptions on Y , we prove an upper bound of the form DY (SN ) ≤ q (C/N) for positive constants C and γ.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.