On value sets of polynomials over a field
Abstract
Let F be any field. Let p(F) be the characteristic of F if F is not of characteristic zero, and let p(F)=+∞ otherwise. Let A1,...,An be finite nonempty subsets of F, and let f(x1,...,xn)=a1x1k+...+anxnk+g(x1,...,xn)∈ F[x1,...,xn] with k in 1,2,3,..., a1,...,an in F\0 and deg(g)<k. We show that |f(x1,...,xn):x1 in A1,...,xn in An| ≥ minp(F),Σi=1n[(|Ai|-1)/k]+1. When k≥ n and |Ai|≥ i for i=1,...,n, we also have |f(x1,...,xn):x1 in A1,...,xn in An, and xi not=xj if i not=j| ≥ minp(F),Σi=1n[(|Ai|-i)/k]+1; consequently, if n≥ k then for any finite subset A of F we have |f(x1,...,xn): x1,...,xn in A, and xi not=xj if i not=j| ≥ minp(F),|A|-n+1. In the case n>k we propose a further conjecture which extends the Erdos-Heilbronn conjecture in a new direction.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.