On Calculating the Cardinality of the Value Set of a Polynomial (and some related problems)
<p> We prove a combinatorial identity that relates the size of the value set of a map with the sizes of various iterated fiber products by this map. This identity is then used as the basis for several algorithms that calculate the size of the value set of a polynomial for a broad class of alge...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
University of California, Irvine
2014
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=3646731 |