On the number of distinct values of a class of functions with finite domain

From MaRDI portal
Publication:404465

DOI10.1007/S00026-014-0220-2zbMATH Open1297.05270arXiv1205.4801OpenAlexW2160265826MaRDI QIDQ404465FDOQ404465

Steven Senger, Robert S. Coulter

Publication date: 4 September 2014

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The upper bound is also connected to triangular numbers, and a slight improvement to this bound could be obtained by resolving a problem on them. In the final section, we consider implications of our bounds in various settings, including finite fields, coding theory and additive combinatorics. In particular, we obtain the first non-trivial upper bound for the image set of a planar function over a finite field; this bound is better than the bound implied by the Dembowski-Ostrom conjecture.


Full work available at URL: https://arxiv.org/abs/1205.4801




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On the number of distinct values of a class of functions with finite domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404465)