![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Finite semifields (finite non-necessarily associative division rings) have traditionally been considered in the context of finite geometries (they coordinatize projective semifield planes). New applications to the coding theory, combinatorics and the graph theory have broadened the potential interest in these rings. We show recent progress in the study of these objects with the help of computational tools. In particular, we state results on the classification and primitivity of semifields obtained with the help of advanced and efficient implementations (both sequential and parallel) of different algorithms specially designed to manipulate these objects.
Acknowledgements
The authors thankfully acknowledge the computer resources, technical expertise and assistance provided by the Centro de Supercomputación y Visualización de Madrid (CeSViMa) and the Spanish Supercomputing Network. E.F. Combarro and J. Ranilla are partially supported by MICINN-TIN2010-14971, MEC-TIN2007-61273 and MEC-TIN2007-29664E and I.F. Rúa is partially supported by MEC-MTM-2010-18370-C04-01, MEC-MTM2007-67884 C04-01 and IB08-147.