Determining Sidon polynomials on Sidon sets over finite fields

Authors

DOI:

https://doi.org/10.13069/jacodesmath.v11i3.281

Keywords:

Sidon sets, Planar polynomial, Finite fields

Abstract

Let $p$ be a prime, and $q=p^n$ be a prime power. In his works on Sidon sets over $\mathbb{F}_q \times \mathbb{F}_q$, Cilleruelo conjectured about polynomials that could generate $q$-element Sidon sets over $\mathbb{F}_q\times \mathbb{F}_q$. In this paper, we derive some criteria for determining polynomials that could generate $q$-element Sidon set over $\mathbb{F}_q\times \mathbb{F}_q$. Using these criteria, we prove that certain classes of monomials and cubic polynomials over $\mathbb{F}_p$ cannot be used to generate $p$-element Sidon set over $\mathbb{F}_p\times \mathbb{F}_p$. We also discover a connection between the needed polynomials and planar polynomials.

Received: 6 March 2023 | Accepted: 26 November 2023

Downloads

Download data is not yet available.

References

P. Allen, P. Keevash, B. Sudakov, and J. Verstraëte, Turán numbers of bipartite graphs plus an odd cycle, J. Combin. Theory Ser. B 106 (2014) 134–162.

E. Bergman, R. S. Coulter, and I. Villa, Classifying planar monomials over fields of order a prime cubed, Finite Fields Their Appl. 78 (2022) 101959.

P. Candela, J. Rué, and O. Serra, Memorial to Javier Cilleruelo: a problem list, Integers 18(A28) (2018) 9 pp.

C. Carlet, Boolean functions for cryptography and coding theory, Cambridge University Press (2021).

J. Cilleruelo, Combinatorial problems in finite fields and Sidon sets, Combinatorica 32 (2012) 497–511.

J. Cilleruelo, I. Ruzsa, and C. Vinuesa, Generalized Sidon sets, Adv. Math. 225(5) (2010) 2786–2807.

R. S. Coulter and F. Lazebnik, On the classification of planar monomials over fields of square order, Finite Fields Their Appl. 18(2) (2012) 316–336.

R. S. Coulter and R. W. Matthews, Planar functions and planes of Lenz-Barlotti class II, Des. Codes Cryptogr. 10 (1997) 167–184.

R. S. Coulter, R. W. Matthews, and C. Timmons, Planar polynomials and an extremal problem of Fischer and Matoušek, J. Combin. Theory Ser. B 128 (2018) 96–103.

P. Dembowski and T. G. Ostrom, Planes of order n with collineation groups of order n², Math. Z. 103 (1968) 239–258.

P. Erdös and P. Turán, On a problem of Sidon in additive number theory, and some related problems, J. London Math. Soc. 16(4) (1941) 212–215.

D. Gluck, A note on permutation polynomials and discrete geometries, Discrete Math. 80(1) (1990) 97–100.

Y. Hiramine, A conjecture on affine planes of prime order, J. Combin. Theory Ser. A 52(1) (1989) 44–50.

R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press (2000).

L. Rónyai and L. Szönyi, Planar functions over finite fields, Combinatorica 9 (1989) 315–320.

J. Solymosi, Incidences and the spectra of graphs, in: Combinatorial Number Theory and Additive Group Theory, Adv. Courses Math. CRM Barcelona, Birkhäuser Basel (2009) 299–314.

C. Timmons and J. Verstraëte, A counterexample to sparse removal, Eur. J. Combin. 44(A) (2015) 77–86.

Downloads

Published

2024-09-01

How to Cite

Afifurrahman, M. . ., & Barra, A. (2024). Determining Sidon polynomials on Sidon sets over finite fields. Journal of Algebra Combinatorics Discrete Structures and Applications, 11(3), 175–187. https://doi.org/10.13069/jacodesmath.v11i3.281

Issue

Section

Articles