Distinct values of a polynomial in subsets of a finite field
Kenneth Williams1969, Canadian Journal of Mathematics
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
If A is a set with only a finite number of elements, we write |A| for the number of elements in A. Let p be a large prime and let m be a positive integer fixed independently of p. We write [pm ] for the finite field with pm elements and [pm ]′ for [pm ] – {0}. We consider in this paper only subsets H of [pm ] for which |H| = h satisfies 1.1 If f(x) ∈ [pm, x] we let N(f; H) denote the number of distinct values of y in H for which at least one of the roots of f(x) = y is in [pm ]. We write d(d ≥ 1) for the degree of f and suppose throughout that d is fixed and that p ≧ p 0(d), for some prime p 0, depending only on d, which is greater than d.
Related papers
On polynomials over finite fields with particular value sets
2017
A classical result on value sets of non-permutation polynomials over finite fields is due to Wan (1993). Denoting the cardinality of the value set of f 2 Fq[x] by jVf j, Wan's result gives the upper bound JVx, where d is the degree of f. A proof of this bound due to Turnwald, which was obtained by the use of symmetric polynomials is given in Chapter 2. A generalization of this result was obtained by Aitken that we also describe here. The work of Aitken focuses on value sets of pairs of polynomials in Fq[x], in particular, he studies the size of the intersection of their value sets. We present pairs of particular polynomials whose value sets do not only have the same size but are actually identical. Clearly, a permutation polynomial f of Fq[x] satisfies jVf j = q. In Chapter 3, we discuss permutation behaviour of pairs of polynomials in Fq[x].
A Note on Value Sets of Polynomials over Finite Fields
2017
Most results on the value sets $V_f$ of polynomials $f \in \mathbb{F}_q[x]$ relate the cardinality $|V_f|$ to the degree of $f$. In particular, the structure of the spectrum of the class of polynomials of a fixed degree $d$ is rather well known. We consider a class $\mathcal{F}_{q,n}$ of polynomials, which we obtain by modifying linear permutations at $n$ points. The study of the spectrum of $\mathcal{F}_{q,n}$ enables us to obtain a simple description of polynomials $F \in \mathcal{F}_{q,n}$ with prescribed $V_F$, especially those avoiding a given set, like cosets of subgroups of the multiplicative group $\mathbb{F}_q^*$. The value set count for such $F$ can also be determined. This yields polynomials with evenly distributed values, which have small maximum count.
N T ] 1 1 O ct 2 01 3 ON THE VALUE SET OF SMALL FAMILIES OF POLYNOMIALS OVER A FINITE FIELD
We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of F q [T ] of degree d for which s consecutive coefficients a d−1 ,. .. , a d−s are fixed. Our estimate holds without restrictions on the characteristic of F q and asserts that V(d, s, a) = µ d q + O(1), where V(d, s, a) is such an average cardinality, µ d := d r=1 (−1) r−1 /r! and a := (a d−1 ,. .. , d d−s). We provide an explicit upper bound for the constant underlying the O-notation in terms of d and s with "good" behavior. Our approach reduces the question to estimate the number of F q-rational points with pairwise-distinct coordinates of a certain family of complete intersections defined over F q. We show that the polynomials defining such complete intersections are invariant under the action of the symmetric group of permutations of the coordinates. This allows us to obtain critical information concerning the singular locus of the varieties under consideration, from which a suitable estimate on the number of F q-rational points is established.
On the value set of small families of polynomials over a finite field, III
arXiv (Cornell University), 2015
We estimate the average cardinality V(A) of the value set of a general family A of monic univariate polynomials of degree d with coefficients in the finite field Fq. We establish conditions on the family A under which V(A) = µ d q + O(q 1/2), where µ d := d r=1 (−1) r−1 /r!. The result holds without any restriction on the characteristic of Fq and provides an explicit expression for the constant underlying the O-notation in terms of d. We reduce the question to estimating the number of Fq-rational points with pairwise-distinct coordinates of a certain family of complete intersections defined over Fq. For this purpose, we obtain an upper bound on the dimension of the singular locus of the complete intersections under consideration, which allows us to estimate the corresponding number of Fq-rational points.
On the Value Sets of Special Polynomials over Finite Fields
Finite Fields and Their Applications, 1996
On counting polynomials over finite fields
Proceedings of the American Mathematical Society, 2015
We give an asymptotic formula for the proportion of polynomials of a given degree over a finite field which do not have odd degree irreducible factors. In the case of odd characteristic, this leads to an asymptotic formula for certain weighted partition function which describes the major proportion of the fundamental discriminants where the "negative" Pell equation cannot be solved. We also extend the results to counting positive divisors over an arbitrary global function field.
Improved lower bound for the number of unimodular zeros of self-reciprocal polynomials with coefficients in a finite set
arXiv (Cornell University), 2017
Let n 1 < n 2 < • • • < n N be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials T N (θ) = N j=1 cos(n j θ) tends to ∞ as a function of N . Conrey's question in general does not appear to be easy. Let P n (S) be the set of all algebraic polynomials of degree at most n with each of their coefficients in S. For a finite set S ⊂ C let M = M (S) := max{|z| : z ∈ S}. It has been shown recently that if S ⊂ R is a finite set and (P n ) is a sequence of self-reciprocal polynomials P n ∈ P n (S) with |P n (1)| tending to ∞, then the number of zeros of P n on the unit circle also tends to ∞. In this paper we show that if S ⊂ Z is a finite set, then every self-reciprocal polynomial P ∈ P n (S) has at least c(log log log |P (1)|) 1-ε -1 zeros on the unit circle of C with a constant c > 0 depending only on ε > 0 and M = M (S). Our new result improves the exponent 1/2 -ε in a recent result by Julian Sahasrabudhe to 1 -ε. Sahasrabudhe's new idea is combined with the approach used in [34] offering an essencially simplified way to achieve our improvement. We note that in both Sahasrabudhe's paper and our paper the assumption that the finite set S contains only integers is deeply exploited.
Polynomials with coefficients from a finite set
Transactions of the American Mathematical Society, 2008
In 1945 Duffin and Schaeffer proved that a power series that is bounded in a sector and has coefficients from a finite subset of C is already a rational function. Their proof is relatively indirect. It is one purpose of this paper to give a shorter direct proof of this beautiful and surprising theorem. This will allow us to give an easy proof of a recent result of two of the authors stating that a sequence of polynomials with coefficients from a finite subset of C cannot tend to zero uniformly on an arc of the unit circle. Another main result of this paper gives explicit estimates for the number and location of zeros of polynomials with bounded coefficients. Let n be so large that δ n := 33π log n √ n satisfies δ n ≤ 1. We show that any polynomial in K n := n k=0 a k z k : |a 0 | = |a n | = 1 and |a k | ≤ 1 has at least 8 √ n log n zeros in any disk with center on the unit circle and radius δ n .
On the Odlyzko–Stanley enumeration problem and Waringʼs problem over finite fields
Journal of Number Theory, 2013
We obtain an asymptotic formula on the Odlyzko-Stanley enumeration problem. Let N * m (k, b) be the number of k-subsets S ⊆ F * p such that x∈S x m = b. If m < p 1−δ , then there is a constant ǫ = ǫ(δ) > 0 such that N * m (k, b) − p −1 p − 1 k ≤ p 1−ǫ + mk − m k. In addition, let γ ′ (m, p) denote the distinct Waring's number (mod p), the smallest positive integer k such that every integer is a sum of m-th powers of k-distinct elements (mod p). The above bound implies that there is a constant ǫ(δ) > 0 such for any prime p and any m < p 1−δ , if ǫ −1 < (e − 1)p δ−ǫ , then γ ′ (m, p) ≤ ǫ −1 .
Related papers
On the value set of small families of polynomials over a finite field, I
Journal of Combinatorial Theory, Series A, 2014
We obtain an estimate on the average cardinality of the value set of any family of monic polynomials of F q [T ] of degree d for which s consecutive coefficients a d−1 ,. .. , a d−s are fixed. Our estimate holds without restrictions on the characteristic of F q and asserts that V(d, s, a) = µ d q + O(1), where V(d, s, a) is such an average cardinality, µ d := d r=1 (−1) r−1 /r! and a := (a d−1 ,. .. , d d−s). We provide an explicit upper bound for the constant underlying the O-notation in terms of d and s with "good" behavior. Our approach reduces the question to estimate the number of F q-rational points with pairwise-distinct coordinates of a certain family of complete intersections defined over F q. We show that the polynomials defining such complete intersections are invariant under the action of the symmetric group of permutations of the coordinates. This allows us to obtain critical information concerning the singular locus of the varieties under consideration, from which a suitable estimate on the number of F q-rational points is established.
Value sets of polynomials over finite fields
Proceedings of the American Mathematical Society, 1993
Let ¥q be the finite field of q elements, and let Vf be the number of values taken by a polynomial f{x) over ¥q. We establish a lower bound and an upper bound of Vf in terms of certain invariants of f(x). These bounds improve and generalize some of the previously known bounds of Vf. In particular, the classical Hermite-Dickson criterion is improved. Our bounds also give a new proof of a recent theorem of Evans, Greene, and Niederreiter. Finally, we give some examples which show that our bounds are sharp.
On the value set of small families of polynomials over a finite field, II
Acta Arithmetica, 2014
On the size of sets in a polynomial variant of a problem of Diophantus
In this paper, we prove that there does not exist a set of 8 polynomials (not all constant) with coefficients in an algebraically closed field of characteristic 0 with the property that the product of any two of its distinct elements plus 1 is a perfect square.
The distribution of values of polynomials over a finite field
Linear Algebra and its Applications, 1990
We investigate the number of distinct values taken by a polynomial of a fixed degree over a finite field EC,. Exact formulae are obtained for the number of polynomials of degree > 9 taking on a specified number of distinct values and for the corresponding variance about the mean. This extends previous results of Cohen and Uchiyama, who derived formulae for the average number of distinct values of such polynomials. 1.
On coefficients of polynomials over finite fields
Finite Fields and Their Applications, 2011
In this paper we study the relation between coefficients of a polynomial over finite field F q and the moved elements by the mapping that induces the polynomial. The relation is established by a special system of linear equations. Using this relation we give the lower bound on the number of nonzero coefficients of polynomial that depends on the number m of moved elements. Moreover we show that there exist permutation polynomials of special form that achieve this bound when m | q − 1. In the other direction, we show that if the number of moved elements is small then there is an recurrence relation among these coefficients. Using these recurrence relations, we improve the lower bound of nonzero coefficients when m q−1 and m ≤ q−1 2. As a byproduct, we show that the moved elements must satisfy certain polynomial equations if the mapping induces a polynomial such that there are only two nonzero coefficients out of 2m consecutive coefficients. Finally we provide an algorithm to compute the coefficients of the polynomial induced by a given mapping with O(q 3/2) operations.
On a conjecture of polynomials with prescribed range
Finite Fields and Their Applications, 2012
We show that, for any integer ℓ with q − √ p − 1 ≤ ℓ < q − 3 where q = p n and p > 9, there exists a multiset M satisfying that 0 ∈ M has the highest multiplicity ℓ and b∈M b = 0 such that every polynomial over finite fields Fq with the prescribed range M has degree greater than ℓ. This implies that Conjecture 5.1. in [1] is false over finite field Fq for p > 9 and k := q − ℓ − 1 ≥ 3.
A Combinatorial Approach to the Number of Solutions of Systems of Homogeneous Polynomial Equations over Finite Fields
Moscow Mathematical Journal
We give a complete conjectural formula for the number er(d, m) of maximum possible Fq-rational points on a projective algebraic variety defined by r linearly independent homogeneous polynomial equations of degree d in m + 1 variables with coefficients in the finite field Fq with q elements, when d < q. It is shown that this formula holds in the affirmative for several values of r. In the general case, we give explicit lower and upper bounds for er(d, m) and show that they are sometimes attained. Our approach uses a relatively recent result, called the projective footprint bound, together with results from extremal combinatorics such as the Clements-Lindström Theorem and its variants. Applications to the problem of determining the generalized Hamming weights of projective Reed-Muller codes are also included.
Counting polynomial subset sums
The Ramanujan Journal, 2018
Let D be a finite subset of a commutative ring R with identity. Let f (x) ∈ R[x] be a polynomial of degree d. For a nonnegative integer k, we study the number In this paper, we establish several bounds for the difference between N f (D, k, b) and the expected main term 1 |R| |D| k , depending on the nature of the finite ring R and f . For R = Zn, let p = p(n) be the smallest prime divisor of n, answering an open question raised by Stanley [29] in a general setting, where . Furthermore, if n is a prime power, then δ(n) = 1/p and one can take C d = 4.41. Similar and stronger bounds are given for two more cases. The first one is when R = Fq, a q-element finite field of characteristic p and f (x) is genetic. The second one is essentially the well-known subset sum problem over an arbitrary finite abelian group. These bounds extend several previous results.
Intersecting families of graphs of functions over a finite field
Ars Mathematica Contemporanea
Let U be a set of polynomials of degree at most k over F q , the finite field of q elements. Assume that U is an intersecting family, that is, the graphs of any two of the polynomials in U share a common point. Adriaensen proved that the size of U is at most q k with equality if and only if U is the set of all polynomials of degree at most k passing through a common point. In this manuscript, we prove a stability version of this result, that is, the same conclusion holds if |U | > q k − q k−1. We prove a stronger result when k = 2. For our purposes, we also prove the following result. If the set of directions determined by the graph of f is contained in an additive subgroup of F q , then the graph of f is a line. While finalizing our manuscript, an even stronger stability version of the above mentioned result for k = 2 was published by Adriaensen in arxiv. Our proof is different, it is a direct proof using polynomials and hence might be of independent interest.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.