Search

Let n be a positive integer, q = 2 n , and let F q be the finite field with q elements. For each positive integer m , let D m ( X ) be the Dickson polynomial of the first kind of degree m with parameter 1. Assume that m > 1 is a divisor of q + 1 . We study the existence of α ∈ F q ⁎ such that D m ( α ) = D m ( α − 1 ) = 0 . We also explore the connections of this question to an open question by Wiedemann and a game called “Button Madness”. [ABSTRACT FROM AUTHOR]

The subset sum problem is an important theoretical problem with many applications, such as in coding theory, cryptography, graph theory and other fields. One of the many aspects of this problem is to answer the solvability of the k -subset sum problem. It has been proven to be NP-hard in general. However, if the evaluation set has some special algebraic structure, it is possible to obtain some good conclusions. Zhu, Wan and Keti proposed partial results of this problem over two special kinds of evaluation sets. We generalize their conclusions in this paper, and propose asymptotical results of the solvability of the k -subset sum problem by using estimates of additive character sums over the evaluation set, together with the Brun sieve and the new sieve proposed by Li and Wan. We also apply the former two examples as application of our results. [ABSTRACT FROM AUTHOR]