New advances in the computational exploration of semifields (CMMSE-09)
Résumé
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 coding theory, combinatorics and graph theory have broaden 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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...