An exponential bound on the number of non-isotopic commutative semifields
Faruk G\"olo\u{g}lu, Lukas K\"olsch

TL;DR
This paper establishes an exponential lower bound on the number of non-isotopic commutative semifields of odd order, introducing new families and methods to improve previous quadratic bounds.
Contribution
The authors introduce a new family of commutative semifields and a novel method for isotopy classification, leading to an exponential bound on their count.
Findings
Number of non-isotopic commutative semifields is exponential in n for certain n.
New family of commutative semifields constructed.
Method for proving isotopy results developed.
Abstract
We show that the number of non-isotopic commutative semifields of odd order is exponential in when and is not a power of . We introduce a new family of commutative semifields and a method for proving isotopy results on commutative semifields that we use to deduce the aforementioned bound. The previous best bound on the number of non-isotopic commutative semifields of odd order was quadratic in and given by Zhou and Pott [Adv. Math. 234 (2013)]. Similar bounds in the case of even order were given in Kantor [J. Algebra 270 (2003)] and Kantor and Williams [Trans. Amer. Math. Soc. 356 (2004)].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · semigroups and automata theory · Advanced Graph Theory Research
