Computer Science > Information Theory
[Submitted on 8 Aug 2024]
Title:On many-to-one mappings over finite fields
View PDF HTML (experimental)Abstract:The definition of many-to-one mapping, or $m$-to-$1$ mapping for short, between two finite sets is introduced in this paper, which unifies and generalizes the definitions of $2$-to-$1$ mappings and $n$-to-$1$ mappings. A generalized local criterion is given, which is an abstract criterion for a mapping to be $m$-to-$1$. By employing the generalized local criterion, three constructions of $m$-to-$1$ mapping are proposed, which unify and generalize all the previous constructions of $2$-to-$1$ mappings and $n$-to-$1$ mappings. Then the $m$-to-$1$ property of polynomials $f(x) = x^r h(x^s)$ on $\mathbb{F}_{q}^{*}$ is studied by using these three constructions. A series of explicit conditions for~$f$ to be an $m$-to-$1$ mapping on $\mathbb{F}_{q}^{*}$ are found through the detailed discussion of the parameters $m$, $s$, $q$ and the polynomial $h$. These results extend many conclusions in the literature.
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.