Polynomial expressions of p-ary auction functions
Abstract
Let Fp be the finite field of prime order p. For any function f Fpn Fp, there exists a unique polynomial over Fp having degree at most p-1 with respect to each variable which coincides with f. We call it the minimal polynomial of f. It is in general a non-trivial task to find a concrete expression of the minimal polynomial of a given function, which has only been worked out for limited classes of functions in the literature. In this paper, we study minimal polynomial expressions of several functions that are closely related to some practically important procedures such as auction and voting.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.