Advanced results in enumeration of hyperfields

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F20%3A00556009" target="_blank" >RIV/60162694:G43__/20:00556009 - isvavai.cz</a>
Result on the web
<a href="https://www.aimspress.com/article/10.3934/math.2020422" target="_blank" >https://www.aimspress.com/article/10.3934/math.2020422</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3934/math.2020422" target="_blank" >10.3934/math.2020422</a>

Result language
angličtina
Original language name
Advanced results in enumeration of hyperfields
Original language description
The purpose of this paper is to introducing a computational method to construction and classification of finite hyperfields (in the sense of Krasner). In this regards first we introduce a mathematical method to produce hyperfields from a family of a non-empty subsets of a given multiplicative group under specific conditions and then we apply this method to enumerate all finite hyperfields of order less that 7, up to isomorphism by a computer programming. Of course this program can be used to produce hyperfields of finite higher orders, but it's commotional complexity is of high order and it must be used of very high-speed computers system.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10102 - Applied mathematics

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)