On the borderline of fields and hyperfields, part II -- Enumeration and classification of the hyperfields of order 7

Christos G. Massouros; Gerasimos G. Massouros

REVIEW 4 major objections 3 minor 64 references

On the borderline of fields and hyperfields, part II -- Enumeration and classification of the hyperfields of order 7

T0 review · 4 major / 3 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims a complete census of seven-element hyperfields: exactly 277 of them, listed table by table and split into quotient and non-quotient families.

desk verdict The order-7 hyperfield census is a real contribution, but the exhaustiveness claim is unauditable without shipped code or data. read the letter →

arxiv 2412.11331 v1 pith:TY3KPVIF submitted 2024-12-15 math.RA

Christos G. Massouros , Gerasimos G. Massouros This is my paper · ORCID

classification math.RA MSC 12K9916Y2012E2020N20

keywords hyperfieldenumerationorder7quotientnon-quotientcanonicalhypergroupaxiomscomputationalalgebra

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asserts that the enumeration of seven-element hyperfields is now complete: there are exactly 277 of them, and every one is displayed as an addition table in the appendix. The route to that census is a definitional economy: the paper proves that Krasner's reversibility axiom is redundant for hyperfields, since distributivity forces $-(a+b)=(-a)+(-b)$, so a computer need only check the remaining axioms. With the multiplicative group necessarily cyclic of order six, Proposition 7 reduces all of addition to four sums of powers of the generator, and filtering then rejects invalid tables and identifies isomorphic copies. The paper also sorts the 277 structures into quotient hyperfields, coming from fields modulo multiplicative subgroups of index six, and non-quotient ones, giving concrete witnesses from prime fields and $GF[p^n]$.

What carries the argument

The machinery is the observation (Proposition 7) that in any order-7 hyperfield, where the nonzero elements form the cyclic group $C_6$ with generator $a$, the hyperoperation is fixed by the four sums $1+1$, $1+a$, $1+a^2$, $1+a^3$; distributivity pushes these to all other pairs, for example $a+a^4 = a(a^3+1)$. A computer then generates candidate tables from these four subsets, checks associativity, commutativity, existence of unique opposites, and distributivity under the reduced axioms, and removes duplicates using the two automorphisms of $C_6$, namely interchanging $a$ with $a^5$ and $a^2$ with $a^4$. For the quotient classification, the key condition is Theorem 17, quoted from the authors' first part, which says when an index-6 subgroup $G$ of a finite field satisfies $G-G=F$, with explicit order thresholds $m \geq 11, 20, 28, 30$ depending on whether $-1\in G$ and on the characteristic.

What would settle it

An independent program that generates all commutative hyperoperations on seven elements, keeps those satisfying the paper's Definition 2 with nonzero elements cyclic of order 6, and tests isomorphism classes should return exactly 277 classes and match the appendix's tables; any extra, missing, or duplicate class would falsify the census. Separately, recomputing the $G-G=F$ condition for the index-6 subgroups listed in Section 6, for instance checking $\mathbb{Z}_{19}/G$, $\mathbb{Z}_{31}/G$, and $\mathbb{Z}_{43}/G$ directly, would test the quotient classification.

Watch

Extended reading notes

Core claim

The central claim is that the paper's list is exhaustive: the 277 structures $HF^1_7, \dots, HF^{277}_7$, with $HF^1_7 = \mathbb{Z}_7$, are pairwise non-isomorphic and no seven-element hyperfield lies outside the list. The census splits into 141 hyperfields without self-opposite elements and 136 with self-opposite elements, subdivided by the cardinality of $x-x$, and Section 6 identifies which entries are quotient hyperfields $F/G$, with $G$ an index-6 subgroup of a finite field's multiplicative group, and which are non-quotient. A supporting claim is that the reduced axiom system of Definition 2, with reversibility removed, is equivalent to Krasner's original Definition 1: in the presence of distributivity the equality $-(a+b)=(-a)+(-b)$ holds, from which Theorem 5 derives reversibility.

Load-bearing premise

The completeness of the census rests on the computer search being airtight: if the filter routine ever discards a candidate that actually is a hyperfield, or fails to recognize two tables as the same structure, the number 277 would be wrong; the paper does not ship the filtering code or the raw output needed to recheck that directly.

Editorial extensions

If this is right

The enumeration closes the classification of hyperfields with seven elements; the complete list in the appendix becomes a finite reference object for any later work involving seven-element hyperfields.
The quotient/non-quotient split is settled: entries such as $HF^9_7$, $HF^{13}_7$, $HF^{61}_7$, $HF^{143}_7$, $HF^{160}_7$, $HF^{234}_7$, $HF^{245}_7$, $HF^{246}_7$, and $HF^{267}_7$ are quotient hyperfields from specific finite fields, while families in other sections, including $HF^{81}_7$ and $HF^{258}_7$, are certified non-quotient.
Because each hyperfield's additive part is a canonical hypergroup, the appendix simultaneously yields a family of 277 seven-element canonical hypergroups.
The reduced axiom system makes membership testing computationally cheaper, so the same pipeline could in principle be pushed to hyperfields of order 8, whose multiplicative group need not be cyclic.
The augmented hyperfield construction maps quotient hyperfields to quotient hyperfields; Theorem 20 matches augmented versions to listed entries, for example $[\mathbb{Z}_7] = HF^2_7$.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If the census is sound, an independent re-computation with different code should reproduce exactly 277 isomorphism classes; that is the cheapest external check of the paper's headline claim.
The same four-sum reduction gives a direct test for order 8: one can bound the search by the possible multiplicative groups of order 7 and use distributivity to reduce the workload, so the next order is plausibly within reach.
Theorem 17's thresholds are stated without proof here but are load-bearing for the quotient labels; re-checking the $G-G=F$ thresholds computationally over the listed fields would independently validate the assignment of $HF^{137}_7$ and neighbouring entries.
The axiom reduction may apply beyond enumeration: any proof about hyperfields that currently invokes reversibility can be rechecked against the weaker definition, and any verification tool using the four-sum reduction for order 7 can be reused as a building block for quotient/non-quotient tests.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

First thing to know: this is a serious census paper, not a crank document. The authors enumerate 277 seven-element hyperfields, sort them into quotient and non-quotient, and they correct a wrong theorem from their own Part I. That last bit is genuinely good behavior. The enumeration is new and, as far as I can spot-check the bookkeeping, internally consistent: Tables 26 and 27 sum to 277, and the specific tables I checked match the claimed classes.

The reduced-axiom theorem (Theorem 5) is also legitimate: distributivity gives (-a)+(-b) = -(a+b), and uniqueness of inverses then yields reversibility. Whether that's entirely new is a question of historiography, but the framing is clean and it makes the computer search feasible.

The soft spot is the load-bearing one: exhaustiveness. The paper claims these are all the hyperfields of order 7, but no code, no data files, and no independent verification are shipped. The enumeration depends on a Mathematica pipeline that is only cited, and the combination of Proposition 7's reduction to four sums with the axiom filters is not something a referee can re-run from the text. The appendix is 277 tables, too big for manual checking. So the central claim rests on trust in software that the paper gives you no way to audit. That's a real deficit for a paper whose whole point is the census.

The classification is also less complete than the abstract suggests. Theorem 21 covers sections A1–A3 and B1–B5, but A4 and B6 (64 hyperfields) are left without a quotient/non-quotient verdict. Theorem 20 leaves eleven isomorphism claims to 'straightforward' proofs, which is fine in a research announcement but not in a census you're supposed to rely on. And Theorem 18(i) has a labeling problem: it lists GF[25]/G and GF[27]/G, while Propositions 10 and 11 talk about GF[5^2] and GF[7^2]. That looks like a typo, but in a paper this dependent on its own classification, it should be fixed.

The dependence on Theorem 17 from [1] is worth naming too. The thresholds in that theorem determine which index-6 subgroups satisfy G−G=F, and a wrong threshold would flip the quotient classification of specific tables like HF^137. The authors are candid about the corrigendum on [1], which is good, but it means the completeness of the quotient classification still rests on a result they cite, not reprove.

Who's this for? People working in hypergroup theory or finite hyperfields, and anyone doing enumerative classification of small algebraic structures. It deserves a serious referee, but the referee should demand the artifacts—either the code and result data, or an independent reproduction of the enumeration. As it stands, the paper is a useful reference with a missing audit trail.

I'd send it to peer review, with the expectation of heavy revision on the reproducibility front.

Referee Report

4 major / 3 minor

Summary. The paper presents a complete enumeration of the 7-element hyperfields, claiming exactly 277 isomorphism classes, listed as tables HF^1_7 through HF^277_7 in the appendix. The enumeration rests on a new reduced axiom system (Definition 2) in which reversibility is dropped because distributivity is said to imply the equality (-a)+(-b)=-(a+b), and Theorem 5 derives reversibility in canonical hypergroups from that equality. The paper also classifies the 277 tables into quotient and non-quotient hyperfields, using a theorem from the authors' earlier paper [1] about when a multiplicative subgroup G of a finite field satisfies G-G=F. Several families of skew hyperfields, strongly canonical and superiorly canonical structures are discussed, and a corrigendum to [1] is included.

Significance. If the enumeration and classification are correct, this is a substantial contribution: it would be the first complete classification of 7-element hyperfields, revealing 277 isomorphism classes with an explicit distinction between quotient and non-quotient examples, and it would provide a useful reduced axiom system that lowers the cost of computer verification. The paper is honest about a previous error in [1] and gives a large amount of explicit data. However, the central claim is a computational census, and the paper does not ship the code or the result data needed for an independent check; the quotient classification also imports a load-bearing theorem from the authors' own previous work without proof. These issues make the main claims plausible but not yet fully verifiable from the manuscript as submitted.

major comments (4)

[Section 5 and Appendix] The exhaustiveness of the 277-hyperfield census is not independently verifiable from the paper. The proof that the 277 tables are exactly the isomorphism classes rests entirely on Proposition 7 and on filters and isomorphism checks implemented in Mathematica packages cited as [44,56-59]. No executable code, no result tables, and no independent implementation are provided. The internal checks in Tables 26 and 27 confirm that the printed tables are partitioned consistently, but they do not rule out a missing candidate, an incomplete axiom filter, or a deduplication step that only uses the two automorphisms of C6. I ask the authors to provide the code and the generated data, or an independent verification by a second implementation, before the census claim can be accepted.
[Theorem 17 and Section 6] The quotient classification in Theorem 18 and the specific statements in Theorem 21 depend on the thresholds m>=11, 20, 28, 30 imported from Theorem 15 of the authors' own paper [1]. These thresholds decide, for example, whether a given table such as HF^137 is classified as a quotient hyperfield. Since [1] is the source of a load-bearing external result and the present paper does not reprove it, the dependence should be made fully explicit with a precise statement, and ideally the relevant part of [1] should be reproduced or independently verified.
[Proposition 4(i), Section 3] The proof of Proposition 4(i) contains a false cardinality claim. It states that card(1+a)=4 while card(b+c)=5, but in Table 5 the entry for b+c is {1,a,b,d}, which has cardinality 4. A correct pair with differing cardinalities appears to be available, for example card(1+a)=4 and card(b+1)=5, but the proof as printed does not establish the stated non-quotient claim without correction.
[Definitions 1 and 2] Neither Definition 1 nor Definition 2 lists 0+x=x as an additive axiom, although this identity is used implicitly throughout the paper and is asserted for canonical hypergroups in Theorem 4. The equivalence of Definition 2 with Krasner's definition, and the correctness of Theorem 5, require a clear statement of the role of 0 as an additive identity. Please add 0+x=x to the explicit axiom list, or prove it from the stated axioms, so that the reduced axiom set used in the computer enumeration is unambiguous.

minor comments (3)

[Throughout] The paper contains many typographical and OCR-style artifacts, such as the notation GF[27] where GF[7^2] is meant in Section 6.3 and garbled displays in Theorem 20. These should be corrected in a final revision.
[Corrigendum on [1]] The corrigendum should state clearly that Theorem 12 of [1] is withdrawn, and the reference to the observation by Hobby and Jun should include full bibliographic details.
[Appendix, Table 25] The discussion of the augmented hyperfield of HF^225 and its isomorphic copy HF^275 is useful, but the sentence explaining that the listed table is not among the list while its isomorphic table is included could be phrased more directly.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the 277-hyperfield census is a genuine computational search, and the only self-citation (Theorem 17) is independent finite-field content.

full rationale

The paper's central claim is an exhaustive census of 7-element hyperfields. The enumeration in Section 5 and the Appendix is a genuine search: Proposition 7 reduces the addition table to the four sums 1+1, 1+a, 1+a^2 and 1+a^3 via distributivity, and the remaining checks are performed by cited computational packages. This is not a fit, and no fitted parameter is later relabeled as a prediction; the count of 277 tables is the output of the generation and filtering process, not an input. The quotient/non-quotient classification leans on Theorem 17 from the authors' own [1], but that theorem concerns finite fields and the condition G - G = F, not hyperfields, and it does not assume the target classification, so under the stated rules it counts as independent content rather than circularity. The individual non-quotient checks in Propositions 3, 4 and the quotient identifications in Propositions 8-15 are supported by explicit tables and cardinality arguments without importing the census count. The absence of shipped code or result data is a reproducibility limitation, not a circularity. The corrigendum on [1] concerns a different hyperring construction and is openly disclosed, and it does not affect the load-bearing argument of this paper. No load-bearing step reduces by construction to its own input; the score reflects only the minor reliance on a self-cited finite-field theorem in the secondary quotient classification.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The central census depends on three classes of unpaid inputs: the package-based verification pipeline, the commutative-multiplicative-group convention, and the borrowed thresholds of Theorem 17 from the authors' Part I. There are no fitted parameters in the mathematical derivations themselves, and no new entities are postulated; the new terms (skew, augmented, total, strongly canonical, superiorly canonical) classify existing objects rather than postulate new ones.

free parameters (1)

Index-6 quotient thresholds (imported from [1], Theorem 15) = m >= 11 when -1 is not in G; m >= 20 when char F = 11; m >= 28 when char F = 13; m >= 30 otherwise
These cutoffs decide exactly when G - G = F for index-6 subgroups of finite fields. They are load-bearing for the completeness of Theorem 18's list of quotient hyperfields of order 7 and are imported from the authors' own [1] without proof in this text.

assumptions (4)

domain assumption Convention: hyperfield means commutative multiplicative group (H*, .); non-abelian cases are classified separately as skew hyperfields.
Adopted in the discussion after Definition 1/2 and used to restrict the order-7 census to H* = C6; the skew cases over D3 are acknowledged but excluded from the count of 277.
standard math Theorem 17 (Theorem 15 of [1]): complete characterization of G - G = F for finite fields F and index-6 subgroups G, with thresholds m >= 11, 20, 28, 30.
Load-bearing for the exhaustiveness of Theorem 18 and for parts of Theorem 21; imported from the authors' own Part I and not reproved or independently verified here.
domain assumption The Mathematica packages of [44, 56-59] correctly implement the hyperfield axioms, the exhaustive candidate search, and isomorphism deduplication.
The 277 count and its exhaustiveness are outputs of these packages; no code or output is included for independent inspection.
standard math Standard facts: C6 is the only abelian group of order 6; Aut(C6) has two elements; Krasner's quotient construction produces hyperfields; uniqueness of the additive inverse is used in Theorem 5.
Used throughout Sections 2 to 6; all are textbook-level background.

how reviews work

0 comments

Cite this review

Pith. "Pith review of On the borderline of fields and hyperfields, part II -- Enumeration and classification of the hyperfields of order 7." pith.science (2026). https://pith.science/paper/TY3KPVIF

@misc{pith2026241211331,
  author       = {Pith},
  title        = {Pith review of: On the borderline of fields and hyperfields, part II -- Enumeration and classification of the hyperfields of order 7},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TY3KPVIF}},
  note         = {Machine review of arXiv:2412.11331}
}

read the original abstract

The quotient hyperfield is a landmark on the borderline of fields and hyperfields. In this paper, which is the second part of our previously published paper, all the hyperfields of order 7 are constructed, enumerated and presented, in the course of which an important family of 7-element canonical hypergroups is revealed. The study of these hyperfields proved the existence of both quotient and non-quotient ones among them. Their construction became feasible because it is based on a new definition of the hyperfield with fewer axioms, which is introduced in this paper following our proof that the axiom of reversibility can derive from the other axioms of the hyperfield. Hence, the processing power needed for a computer to test whether a structure is a hyperfield or not is much less. This paper also proves properties and contains examples of skew hyperfields, strongly canonical hyperfields/hyperrings and superiorly canonical hyperfields/hyperrings that wrap up and complete the previously published conclusions and results of its first part.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

64 extracted references · 60 canonical work pages

[25]

Hypergroupes canoniques values et hypervalues

Mittas, J. Hypergroupes canoniques values et hypervalues. Math. Balk 1971, 1, 181–185

work page 1971
[27]

Certaines remarques sur les hypergroupes canoniques hypervaluables et fortement canoniques

Mittas, J. Certaines remarques sur les hypergroupes canoniques hypervaluables et fortement canoniques. Riv. Mat. Pura Appl. 1991, 9, 61–67

work page 1991
[1]

On the borderline of fields and hyperfields, Mathematics, 2023, 11(6), 1289; https://doi.org/10.3390/math11061289

Massouros, C.G.; Massouros, G.G. On the borderline of fields and hyperfields, Mathematics, 2023, 11(6), 1289; https://doi.org/10.3390/math11061289

doi:10.3390/math11061289 2023
[2]

Sur une généralisation de la notion de groupe

Marty, F. Sur une généralisation de la notion de groupe . Huitième Congrès des mathématiciens Scand., Stockholm 1934, pp. 45-49

work page 1934
[3]

Krasner, M. Approximation des corps valués complets de caractéristique p≠0 par ceux de caractéristique 0, Colloque d’ Algèbre Supérieure (Bruxelles, Decembre 1956); Centre Belge de Recherches Mathématiques, Établissements Ceuterick, Louvain, Librairie Gauthier-Villars: Paris, France, 1957; pp. 129–206

work page 1956
[4]

On connections between vector spaces and hypercompositional structures

Massouros, C.G. On connections between vector spaces and hypercompositional structures. Ital. J. Pure Appl. Math. 2015, 34, 133–150

work page 2015
[5]

An Overview of the Foundations of the Hypergroup Theory

Massouros, C.G.; Massouros, G.G. An Overview of the Foundations of the Hypergroup Theory. Mathematics, 2021, 9, 1014, doi.org/10.3390/math8081338

work page doi:10.3390/math8081338 2021
[6]

On the semi -subhypergroups of a hypergroup

Massouros, C.G. On the semi -subhypergroups of a hypergroup. Int. J. Math. Math. Sci. 1991, 14, 293 –304. [CrossRef]

work page 1991

Show all 64 references

[7]

A class of hyperrings and hyperfields

Krasner, M. A class of hyperrings and hyperfields. Int. J. Math. Math. Sci. 1983, 6, 307–312. [CrossRef]

1983
[9]

Hypergroupes canoniques hypervalues, C.R

Mittas, J. Hypergroupes canoniques hypervalues, C.R. Acad. Sci. Paris 1970, 271, 4–7

1970
[10]

Hypergroupes canoniques values et hypervalues

Mittas, J. Hypergroupes canoniques values et hypervalues. Hypergroupes fortement et superieurement canoniques. Bull. Greek Math. Soc. 1982, 23, 55–88

1982
[11]

Methods of constructing hyperfields

Massouros, C.G. Methods of constructing hyperfields. Int. J. Math. Math. Sci. 1985, 8, 725–728. [CrossRef]

1985
[12]

Cours d’ Algebre superieure, Theories des valuation et de Galois

Krasner, M. Cours d’ Algebre superieure, Theories des valuation et de Galois. Cours Fac. Sci. L’ Univ. Paris, 1967-68, pp.1 - 305

1967
[13]

Constructions of hyperfields, Math

Massouros, C.G. Constructions of hyperfields, Math. Balk. 1991, vol 5, fasc. 3, pp. 250-257

1991
[14]

Proofs from THE BOOK, 6th ed.; Springer: Berlin, Germany, 2018; pp

Aigner, M.; Ziegler, G. Proofs from THE BOOK, 6th ed.; Springer: Berlin, Germany, 2018; pp. 35–38

2018
[15]

On the theory of hyperrings and hyperfields

Massouros, C.G. On the theory of hyperrings and hyperfields. Algebra i Logika 1985, 24, 728–742. [CrossRef]

1985
[16]

A class of hyperfields and a problem in the theory of fields, Mathematica Montisnigri, 1993, 1, pp

Massouros, C.G. A class of hyperfields and a problem in the theory of fields, Mathematica Montisnigri, 1993, 1, pp. 73-84

1993
[17]

Recent results in hyperring and hyperfield theory, Internat

Nakassis, A. Recent results in hyperring and hyperfield theory, Internat. J. of Math. & Math. Sci. 1988, 11, 209- 220

1988
[18]

An equivalence between two approaches to limits of local fields

Tolliver J. An equivalence between two approaches to limits of local fields. J. Number Theory 2016, 166, 473– 492,

2016
[19]

Hyperfields, truncated DVRs, and valued fields

Lee J. Hyperfields, truncated DVRs, and valued fields. J. Number Theory, 2020, 212, 40–71

2020
[20]

Orderings and valuations in hyperfields

Kuhlmann, K.; Linzi, A.; Stojałowska H. Orderings and valuations in hyperfields. J. Algebra, 2022, 611, 399– 421

2022
[21]

On the hyperfields associated to valued fields

Linzi A.; Touchard P. On the hyperfields associated to valued fields. arXiv:2211.05082, 2022

2022 arXiv
[22]

Notes on valuation theory for Krasner hyperfields

Linzi A. Notes on valuation theory for Krasner hyperfields. arXiv:2301.08639, 2023

2023 arXiv
[23]

Contributions a la théorie des hypergroupes, hyperanneaux, et les hypercorps hypervalues, C

Mittas, J. Contributions a la théorie des hypergroupes, hyperanneaux, et les hypercorps hypervalues, C. R. Acad. Sci. Paris, 1971, t. 272, Serie A, pp. 3-6

1971
[24]

Certains hypercorps et hyperanneaux définis à partir de corps et anneaux ordonnés, Bull

Mittas, J. Certains hypercorps et hyperanneaux définis à partir de corps et anneaux ordonnés, Bull. Math. de la Soc Sci. Math. de la R. S. Roumanie, 1971, t. 15 (63), nr. 3, pp. 371-378

1971
[26]

Contribution à la théorie des structures ordonnées et des structures valuées, Proceedings of the Academy of Athens, 1973, vol

Mittas, J. Contribution à la théorie des structures ordonnées et des structures valuées, Proceedings of the Academy of Athens, 1973, vol. 48, pp. 318-331

1973
[28]

Hypergroupes canoniques

Mittas, J. Hypergroupes canoniques. Math. Balk. 1972, 2, 165–179

1972
[29]

Sur les structures hypercompositionnelles, Algebraic Hyperstructures and Applications

Mittas, J. Sur les structures hypercompositionnelles, Algebraic Hyperstructures and Applications. In Proceedings of the 4th Int. Cong., Xanthi, Greece, June 27 -30, 1990; World Scientific: Singapore, 1991; pp. 9 – 31

1990
[30]

Sur les hyperanneaux et les hypercorps, 1973, Math

Mittas, J. Sur les hyperanneaux et les hypercorps, 1973, Math. Balk. 3, pp. 368-382

1973
[31]

Hyperfields for Tropical Geometry I

Viro, O. Hyperfields for Tropical Geometry I. Hyperfields and dequantization, arXiv 2010, arxiv:1006.3034 [math.AG], 45 pages

2010 arXiv
[32]

On basic concepts of tropical geometry

Viro, O. On basic concepts of tropical geometry. Proc. Steklov Inst. Math., 2011, 273(1) pp. 252–282

2011
[33]

Matroids over hyperfields, arxiv 2017, arxiv:1601.01204v5 [math.CO], pages 31

Baker, M.; Bowler N. Matroids over hyperfields, arxiv 2017, arxiv:1601.01204v5 [math.CO], pages 31. CHRISTOS G. MASSOUROS and GERASIMOS G. MASSOUROS - 126 -

2017 arXiv
[34]

Geometry of hyperfields, arxiv 2017, arxiv:1707.09348v2 [math.AG], 26 pages

Jun, J. Geometry of hyperfields, arxiv 2017, arxiv:1707.09348v2 [math.AG], 26 pages

2017 arXiv
[35]

Tropical geometry over the tropical hyperfield, Rocky Mountain J

Lorscheid, O. Tropical geometry over the tropical hyperfield, Rocky Mountain J. Math. 2022, 52 (1), 189–222, doi 10.1216/rmj.2022.52.189

2022 doi
[36]

Nontrivial solutions for homogeneous linear equations over some non-quotient hyperfields

Hobby, D.; Jun, J. Nontrivial solutions for homogeneous linear equations over some non-quotient hyperfields. arxiv 2023, arXiv:2306.13232

2023 arXiv
[37]

Hypergroups and their applications, Ph.D

Massouros, C.G. Hypergroups and their applications, Ph.D. Thesis, National Technical University of Athens, Greece, 1988

1988
[38]

A Field Theory Problem Relating to Questions in Hyperfield Theory , AIP Conf

Massouros, C.G. A Field Theory Problem Relating to Questions in Hyperfield Theory , AIP Conf. Proc. 1389, 1852-1855 (2011); doi: 10.1063/1.3636971

2011 doi
[39]

Multiplicative subgroups of finite index in a ring

Bergelson, V.; Shapiro, D. Multiplicative subgroups of finite index in a ring. Proc. Amer. Math. Soc., 1992, 116, 885-896

1992
[40]

Multiplicative subgroups of finite index in a division ring

Turnwald, G. Multiplicative subgroups of finite index in a division ring. Proc. Amer. Math. Soc. 1994, 120, 377- 381

1994
[41]

Semi-ipergruppi e ipergruppi ciclici, Atti Sem

De Salvo, M.; Freni, D. Semi-ipergruppi e ipergruppi ciclici, Atti Sem. Mat. Fis. Univ. Modena, 1981, 30, 44-59

1981
[42]

Ipergruppi di cardinalità 3 e isomorfismi di ipergruppoidi commutativi totalmente regolari, Atti Convegno su Ipergruppi, Udine, Italy, October 15-18, 1985, pp.131-136

Migliorato,R. Ipergruppi di cardinalità 3 e isomorfismi di ipergruppoidi commutativi totalmente regolari, Atti Convegno su Ipergruppi, Udine, Italy, October 15-18, 1985, pp.131-136

1985
[43]

An algorithm on number of isomorphism classes of hypergroups of order 3, Ital

Nordo, G. An algorithm on number of isomorphism classes of hypergroups of order 3, Ital. J. Pure Appl. Math. 1997, 2, 37–42

1997
[44]

On enumeration of hypergroups of order 3

Tsitouras, C.G.; Massouros, C.G. On enumeration of hypergroups of order 3. Comput. Math. Appl. 2010, 59, 519–523, doi:10.1016/j.camwa.2009.06.013

2010 doi
[45]

Hypergroups of type u on the right of size five

De Salvo, M.; Freni, D.; Lo Faro, G. Hypergroups of type u on the right of size five. Part two. Matematički Vesnik, 2008, 60(231) pp. 23-45

2008
[46]

Isomorphism classes of the hypergroups of type U on the right of size five, Computers and Mathematics with Applications, 2009, 58, 390–402

De Salvo, M.; Fasino, D.; Freni, D.; Lo Faro, G. Isomorphism classes of the hypergroups of type U on the right of size five, Computers and Mathematics with Applications, 2009, 58, 390–402

2009
[47]

Fully simple semihypergroups, transitive digraphs, and Sequence A000712

De Salvo, M.; Fasino, D.; Freni, D.; Lo Faro, G. Fully simple semihypergroups, transitive digraphs, and Sequence A000712. J. Algebra, 2014, 415, 65–87

2014
[48]

On hypergroups with a b-class of finite height

De Salvo, M.; Fasino, D.; Freni, D.; Lo Faro, G. On hypergroups with a b-class of finite height. Symmetry, 2020, 12, 168

2020
[49]

1-hypergroups of small sizes

De Salvo, M.; Fasino, D.; Freni, D.; Lo Faro, G. 1-hypergroups of small sizes. Mathematics, 2021, 9, 108

2021
[50]

G-Hypergroups: Hypergroups with a Group-Isomorphic Heart

De Salvo, M.; Fasino, D.; Freni, D.; Lo Faro, G. G-Hypergroups: Hypergroups with a Group-Isomorphic Heart. Mathematics, 2022, 10, 240. doi.org/10.3390/math10020240

2022 doi
[51]

The Class Equation and the Commutativity Degree for Complete Hypergroups, Mathematics, 2020, 8, 2253; doi:10.3390/math8122253

Sonea, A.C.; Cristea, I. The Class Equation and the Commutativity Degree for Complete Hypergroups, Mathematics, 2020, 8, 2253; doi:10.3390/math8122253

2020 doi
[52]

Classification of Krasner Hyperfields of Order 4

Iranmanesh, M.; Jafarpour, M.; Aghabozorgi, H.; Zhan, J.M. Classification of Krasner Hyperfields of Order 4. Acta Math. Sin. (Engl. Ser.) 2020, 36, 889–902

2020
[53]

Advanced results in enumeration of hyperfields

Ameri, R.; Eyvazi, M.; Hoskova -Mayerova, S. Advanced results in enumeration of hyperfields. AIMS Math. 2020, 5, 6552–6579

2020
[54]

Finite Hyperfields with order n≤5

Liu, Z. Finite Hyperfields with order n≤5. arXiv 2020, arXiv:2004.07241

2020 arXiv
[55]

On the Structure of Hyperfields Obtained as Quotients of Fields

Baker, M.; Jin, T. On the Structure of Hyperfields Obtained as Quotients of Fields. Proc. Am. Math. Soc. 2021, 149, 63–70

2021
[56]

Square Roots of Total Boolean Matrices: Enumeration Issues, 2009 16th International Conference on Systems, Signals and Image Processing, Chalkida, Greece, 2009, pp

Massouros, C.G.; Tsitouras, C.G.; Voliotis S. Square Roots of Total Boolean Matrices: Enumeration Issues, 2009 16th International Conference on Systems, Signals and Image Processing, Chalkida, Greece, 2009, pp. 1-4, doi: 10.1109/IWSSIP.2009.5367718

2009
[57]

Enumeration of hypercompositional structures defined by binary relations

Massouros, C.G.; Tsitouras, C.G. Enumeration of hypercompositional structures defined by binary relations. Ital. J. Pure Appl. Math. 2011, 28, 43–54

2011
[58]

Enumeration of Rosenberg type hypercompositional structures defined by binary relations, Eur

Tsitouras, C.G.; Massouros, C.G. Enumeration of Rosenberg type hypercompositional structures defined by binary relations, Eur. J. Comb. 2012, 33, 1777–1786, doi:10.1016/j.ejc.2012.03.032

2012 doi
[59]

On the Theory of Left/Right Almost Groups and Hypergroups with their Relevant Enumerations, Mathematics, 2021, 9, 1828; doi.org/10.3390/math9151828

Massouros, C.G.; Yaqoob, N. On the Theory of Left/Right Almost Groups and Hypergroups with their Relevant Enumerations, Mathematics, 2021, 9, 1828; doi.org/10.3390/math9151828

2021 doi
[60]

On the enumeration of rigid hypercompositional structures

Massouros, C.G. On the enumeration of rigid hypercompositional structures. AIP Conf. Proc. 2014, 1648, 740005-1–740005-6, 6; doi:10.1063/1.4912960

2014 doi
[61]

On 2-element Fuzzy and Mimic Fuzzy Hypergroups

Massouros, C.G.; Massouros, G.G. On 2-element Fuzzy and Mimic Fuzzy Hypergroups. AIP Conf. Proc. 2012, 1479, 2213–2216, doi:10.1063/1.4756632

2012 doi
[62]

Enumeration of Rosenberg hypergroups, Comput

Cristea, I.; Jafarpour, M.; Mousavi, S.; Soleymani, A. Enumeration of Rosenberg hypergroups, Comput. Math. Appl. 2010, 60, 2753-2763. ON THE BORDERLINE OF FIELDS AND HYPERFIELDS, PART II ENUMERATION AND CLASSIFICATION OF THE HYPERFIELDS OF ORDER 7 - 127 -

2010
[63]

A method to compute the number of regular reversible Rosenberg hypergroup, ARS Comb

Jafarpour, M.; Cristea, I.; Tavakoli, A. A method to compute the number of regular reversible Rosenberg hypergroup, ARS Comb. 2018, 128, 309–329

2018
[64]

Classifications of unitary Krasner hyperrings of small order, Facta Universitatis (NIS) Ser

Mirvakili, S; Hamidizadeh, K; Manaviyat, R. Classifications of unitary Krasner hyperrings of small order, Facta Universitatis (NIS) Ser. Math. Inform. 2024, 39, 481–492

2024
[65]

Wolfram, S., The Mathematica Book, 5th ed., Wolfram Media, 2003. CORE DEPARTMENT, EURIPUS CAMPUS, NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS, Email address: chrmas@uoa.gr or ch.massouros@gmail.com SCHOOL OF SOCIAL SCIENCES, HELLENIC OPEN UNIVERSITY, Email address: germasou...

2003

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.

[1] [25]

Hypergroupes canoniques values et hypervalues

Mittas, J. Hypergroupes canoniques values et hypervalues. Math. Balk 1971, 1, 181–185

work page 1971

[2] [27]

Certaines remarques sur les hypergroupes canoniques hypervaluables et fortement canoniques

Mittas, J. Certaines remarques sur les hypergroupes canoniques hypervaluables et fortement canoniques. Riv. Mat. Pura Appl. 1991, 9, 61–67

work page 1991

[3] [1]

On the borderline of fields and hyperfields, Mathematics, 2023, 11(6), 1289; https://doi.org/10.3390/math11061289

Massouros, C.G.; Massouros, G.G. On the borderline of fields and hyperfields, Mathematics, 2023, 11(6), 1289; https://doi.org/10.3390/math11061289

doi:10.3390/math11061289 2023

[4] [2]

Sur une généralisation de la notion de groupe

Marty, F. Sur une généralisation de la notion de groupe . Huitième Congrès des mathématiciens Scand., Stockholm 1934, pp. 45-49

work page 1934

[5] [3]

Krasner, M. Approximation des corps valués complets de caractéristique p≠0 par ceux de caractéristique 0, Colloque d’ Algèbre Supérieure (Bruxelles, Decembre 1956); Centre Belge de Recherches Mathématiques, Établissements Ceuterick, Louvain, Librairie Gauthier-Villars: Paris, France, 1957; pp. 129–206

work page 1956

[6] [4]

On connections between vector spaces and hypercompositional structures

Massouros, C.G. On connections between vector spaces and hypercompositional structures. Ital. J. Pure Appl. Math. 2015, 34, 133–150

work page 2015

[7] [5]

An Overview of the Foundations of the Hypergroup Theory

Massouros, C.G.; Massouros, G.G. An Overview of the Foundations of the Hypergroup Theory. Mathematics, 2021, 9, 1014, doi.org/10.3390/math8081338

work page doi:10.3390/math8081338 2021

[8] [6]

On the semi -subhypergroups of a hypergroup

Massouros, C.G. On the semi -subhypergroups of a hypergroup. Int. J. Math. Math. Sci. 1991, 14, 293 –304. [CrossRef]

work page 1991