- 期刊
ON FUNDAMENTAL SETS OVER A FINITE FIELD
並列摘要
A partition over finite field is defined and each equivalence class is constructed and represented by a set called the fundamental set. If a primitive element is used to construct the addition table over these fundamental sets then all additions over the field can be computed. The number of partitions is given for some finite fields.
延伸閱讀
- BAIAZS, K., & KILGORE, T. (1995). ON SOME CONSTANTS IN SIMULTANEOUS APPROXIMATION. International Journal of Mathematics and Mathematical Sciences, 1995(), 279-286. https://doi.org/10.1155/S0161171295000342
- Huang, T. Y. (2008). On Minimizing Weighted Finite Automata [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2008.02798
- Appling, W. D. L. (1984). FIELDS OF SETS, SET FUNCTIO S, SET FUNCTION INTEGRALS, AND FINITE ADDITIVITY. International Journal of Mathematics and Mathematical Sciences, 1984(), 209-233. https://doi.org/10.1155/S0161171284000235
- MATTHEWS, R., & LIDL, R. (1988). ON GENERALIZED REDEI FUNCTIONS. International Journal of Mathematics and Mathematical Sciences, 1988(), 625-634. https://doi.org/10.1155/S0161171288000766
- Hawary, T. A., Frasin, B. A., & Darus, M. (2013). On Certain Subclass of Analytic Functions with Fixed Point. Journal of Applied Mathematics, 2013(), 101-108-211. https://doi.org/10.1155/2013/312387