×

Generalized trigonometry and Chebyshev functions in finite fields. (English) Zbl 1512.11092

Trigonometry in finite fields was first introduced in [ISIT 1998 (1998; doi:10.1109/ISIT.1998.708898)] and further developed in [J. B. Lima et al., in: Applied algebra and number theory. Essays in honor of Harald Niederreiter on the occasion of his 70th birthday. Cambridge: Cambridge University Press, 255–279 (2014; Zbl 1346.11064)] giving many properties similar to the trigonometric functions over the reals. Those explorations used a degree-2 extension field of a base field. In the paper under review, the authors generalize the definitions of trigonometric functions and their related Chebyshev polynomials to arbitrary degrees.
In the second reference above, Lima, Panario, and Campello de Souza developed trigonometry in finite fields \(\mathbb{F}_q\) of odd characteristic. It was shown how these functions have many properties shared with the trigonometric functions on the real numbers, such as an analogue of the unit circle law, an angle sum formula, symmetries, and something like the Euler equation. In this paper, the authors show that these definitions and properties can be significantly generalized.

MSC:

11T06 Polynomials over finite fields
12E10 Special polynomials in general fields
33B10 Exponential and trigonometric functions

Citations:

Zbl 1346.11064
Full Text: DOI

References:

[1] Campello De Souza, R. M.; de Oliveira, H. M.; Kauffman, A. N.; Paschoal, A. J.A., Trigonometry in finite fields and a new Hartley transform, (Proceedings of the 1998 IEEE International Symposium on Information Theory (Cat. No. 98CH36252) (1998)), 293
[2] Dummitt, David S.; Foote, Richard M., Abstract Algebra (1999), John Wiley and Sons, Inc. · Zbl 0943.00001
[3] Gold, R., Characteristic linear sequences and their coset functions, SIAM J. Appl. Math., 14, 5, 980-985 (1966) · Zbl 0208.21203
[4] Golomb, S. W., Shift Register Sequences (1967), Holden-Day Inc. · Zbl 0267.94022
[5] Goresky, Mark; Klapper, Andrew, Algebraic Shift Register Sequences (2012), Cambridge University Press · Zbl 1248.94002
[6] Lidl, R.; Mullen, G. L.; Turnwald, G., Dickson Polynomials, Pitman Monographs and Surveys in Pure and Applied Mathematics, vol. 65 (1993), Longman Scientific & Technical · Zbl 0823.11070
[7] Lidl, R.; Niederreiter, H., Introduction to Finite Fields and Their Applications (1994), Cambridge University Press · Zbl 0820.11072
[8] Lima, Juliano B.; Panario, Daniel, A trigonometric approach for Dickson polynomials over fields of characteristic two, Appl. Algebra Eng. Commun. Comput., 31, 3, 253-270 (June 2020) · Zbl 1459.11222
[9] Lima, Juliano B.; Panario, Daniel; Campello de Souza, Ricardo M., A trigonometric approach for Chebyshev polynomials over finite fields, (Applied Algebra and Number Theory: Essays in Honour of Harald Niederreiter (on the Occasion of His 70th Birthday) (2015), Cambridge University Press), 255-279, Chapter 15 · Zbl 1346.11064
[10] Matthews, Rex W., Permutation polynomials in one and several variables (October 1982), University of Tasmania, PhD thesis
[11] Niederreiter, H., Orthogonal systems of polynomials in finite fields, Proc. Am. Math. Soc., 28, 2, 415-422 (May 1971) · Zbl 0207.35003
[12] Ostafe, Alina; Thomson, David; Winterhof, Arne, On the Waring problem with multivariate Dickson polynomials, (Proceedings of the 10th International Conference on Finite Fields and their Applications. Proceedings of the 10th International Conference on Finite Fields and their Applications, Contemporary Mathematics, vol. 579 (2012)), 153-161 · Zbl 1294.11171
[13] Willet, Michael, Factoring polynomials over a finite field, SIAM J. Appl. Math., 35, 2, 333-337 (1978) · Zbl 0402.12015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.