Pith. sign in

REVIEW 3 major objections 4 minor 29 references

Algorithmic Construction of Real Hyperfields from Minimal Axioms

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

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

Pith's one-line read A finite real hyperfield with cyclic positive cone is determined by half the cone data plus three minimal axioms.

desk verdict Solid N<=7 classification of real hyperfields with cyclic positive cones; the N=8 C-characteristic claims are not backed by the described algorithm. read the letter →

arxiv 2508.19418 v1 pith:62DC5WBG submitted 2025-08-26 math.RA

Dawid E. Kędzierski , Katarzyna Kuhlmann , Hanna Stoja{l}owska This is my paper · ORCID
classification math.RA MSC 16Y2012K9912E2020N2008A05
keywords hyperfieldrealcyclicpositiveconeC-characteristicminimalaxiomsenumerationalgorithmclassificationofhyperfieldsKrasnerquotient
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

The paper establishes that every finite real hyperfield whose positive cone is cyclic is encoded by a short list of subsets: the sets $1+a^i$ for $i=0,\dots,\lfloor N/2\rfloor$, where $N$ is the order of the positive cone. It proves that three conditions on those subsets—covering the cone, a commutativity identity, and an agreement of positive parts—are sufficient to build a real hyperfield, and that removing any one of them lets the structure cease to be a hyperfield. This reduction turns the classification into a finite search over bit-mask tuples, and the paper carries it out completely for positive-cone orders $1,\dots,7$ (hyperfield cardinalities $3,5,\dots,15$) and computes the C-characteristic for order $8$ as well. Because every finite real hyperfield whose C-characteristic exceeds 1 is not a Krasner quotient hyperfield, the enumeration yields many new examples outside Krasner's quotient construction.

What carries the argument

The carrying object is the generating family $\mathcal P=\{A_x\}_{x\in P}$ with $A_x=1+x$, together with the symmetry $A_{a^k}=a^k A_{a^{N-k}}$ that halves the amount of data to $\lfloor N/2\rfloor+1$ subsets. Subsets are encoded as exponent bit masks, so each candidate hyperstructure is a tuple of integers; the shift operator implements multiplication by $a^k$, formula (6) extends the family to negative elements, and Algorithm 14 exhausts all tuples while checking (kr0)–(kr2). The three axioms are exactly the conditions, under the cyclic specialization, under which the $A$-family produces a hyperfield.

What would settle it

Run an independent exhaustive enumeration of the defining tuples for $N=8$ with symmetry breaking: if it produces an isomorphism class with C-characteristic 4 or higher, or a count different from 190 for C-characteristic 3, the completeness claim for hyperfield cardinality 17 is refuted.

Watch

Extended reading notes

Core claim

The central claim, stated in Theorem 3.3 and Theorem 4.3, is that a finite real hyperfield with cyclic positive cone $P=\langle a\rangle$ of order $N$ is completely determined by the family of subsets $A_{a^i}=1+a^i\subseteq P$ for $0\le i\le \lfloor N/2\rfloor$, with the remaining sets forced by $A_{a^k}=a^k A_{a^{N-k}}$. Conversely, any such family satisfying (kr0) $\bigcup_{x\in P}A_x=P$, (kr1) $A_x+y=A_y+x$, and (kr2) $(A_x-y)\cap P=(A_{-y}+x)\cap P$ yields a real hyperfield, and the paper claims these axioms are minimal. The algorithm encodes each candidate by a $(\lfloor N/2\rfloor+1)$-tuple of subset codes, verifies the three conditions, computes the C-characteristic, and records one representative per isomorphism class. The reported tables give complete classifications up to hyperfield cardinality 15 and all C-characteristics occurring up to cardinality 17: C-characteristic 2 first appears for cone order 3, C-characteristic 3 first for cone order 7, and the order-8 search finds 190 isomorphism classes with C-characteristic 3 and none higher.

Load-bearing premise

For positive-cone order 8, the claim that no C-characteristic above 3 occurs rests on the assumption that the search restricted to C-characteristic greater than 2 found all such hyperfields; the paper gives no proof or optimized procedure that this restriction is exhaustive.

Editorial extensions

If this is right

  • The classification tables for cone orders $N=1,\dots,7$ give explicit counts of hyperfields and isomorphism classes, so the full landscape of these structures is known up to cardinality 15.
  • Because the axiom set is minimal, any enumeration that uses fewer conditions on the $A_x$ family would admit non-hyperfield structures; the algorithm is optimal within this representation.
  • Every hyperfield in the enumeration with C-characteristic greater than 1 is, by Theorem 2.20, not a Krasner quotient hyperfield, so the tables supply a large family of new counterexamples to the conjecture that all hyperfields arise by Krasner's construction.
  • For cone order 8, the search reports exactly 190 isomorphism classes with C-characteristic 3 and no higher C-characteristics, extending the data to hyperfield cardinality 17.

Reading between the lines

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

  • The same halving symmetry could be attempted for non-cyclic finite positive cones, where no analogue of the identity $A_{a^k}=a^kA_{a^{N-k}}$ is automatic; finding such a symmetry would be a natural extension of the method.
  • The reported completeness for order 8 would be strengthened by an independent symmetry-reduced exhaustive search, since the raw tuple space of roughly $(2^8-1)^5$ candidates is too large for the brute-force loop as written.
  • If the observed pattern that C-characteristic stays bounded by 3 for these orders persists, one could conjecture a bound on C-characteristic in terms of the positive-cone order; the paper does not claim such a bound.
  • Because the paper only applies the C-characteristic criterion to identify non-quotient examples, one could go further and test each low-order isomorphism class directly against quotient constructions; that would likely sharpen where the quotient/non-quotient boundary lies.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper studies finite real hyperfields whose positive cone P is a cyclic group of order N, and develops an algorithm to enumerate them up to isomorphism. The main theoretical reduction is Theorem 3.3: for a real hyperfield with positive cone P, the hyperaddition is determined by the family {A_x}_{x in P}, where A_x = 1+x, and a family of nonempty subsets of P generates a hyperfield exactly when conditions (kr0)-(kr3) hold. For cyclic P, Theorem 4.3 shows that the symmetry condition (kr3) is automatic once the sets A_{a^i} are defined for i=0,...,floor(N/2) and extended by A_{a^k}=a^k A_{a^{N-k}}, so only (kr0), (kr1), (kr2) need to be checked. The paper provides pseudocode for the construction, the verification of the axioms, the computation of the C-characteristic, and the grouping into isomorphism classes via automorphisms of P. The reported computational results give exhaustive counts for N<=7 (hyperfield orders 3 through 15) and, for N=8, counts of isomorphism classes with C-characteristic equal to 3 under a restriction to C-characteristic exceeding 2. The paper also uses a criterion from the authors' earlier work to conclude that many of the constructed hyperfields are not Krasner quotient hyperfields.

Significance. The reduction of finite real hyperfields with cyclic positive cones to tuples of subsets satisfying three explicit conditions is a clean and useful contribution, and the exhaustive classification for N<=7 is a concrete advance over the previously known enumerations. The proof that (kr3) is redundant in the cyclic case is elegant and makes the search space for N<=7 exactly the stated one. The paper ships pseudocode, software, and a Zenodo database, which strengthens reproducibility. The main significance is however conditional on two points: the claim that the axiom set is minimal is asserted without proof, and the N=8 part of the classification is not backed by a described exhaustive procedure. The conclusion that no hyperfields with C-characteristic higher than 3 occur at N=8 is exactly the kind of negative statement that requires a complete search or a proof; at present it is not reproducible from the manuscript.

major comments (3)
  1. [Section 6, Table 6.2 and Abstract] The N=8 statement that there are exactly 190 isomorphism classes with C-characteristic 3 and no hyperfields with higher C-characteristics is not supported by the described algorithm. Algorithm 14 is the only enumeration procedure given, and for N=8 it would iterate over (2^8-1)^5 candidate tuples, which is about 1.08e12 cases. The text says that for N>7 the analysis is restricted to C-characteristic exceeding 2, but it does not describe a specialized enumeration, a pruning method, or a theorem bounding the C-characteristic. Consequently the abstract's claim of identifying the C-characteristics occurring in hyperfields of order up to 17, and the sentence 'In this case, no hyperfields with higher C-characteristics are found,' are not justified by the material in the paper. The authors should either provide the exhaustive procedure used for N=8 (with enough detail to reproduce it), prove an upper bound on C-characteristic, or explicitly state that the N=8 results are partial.
  2. [Remark 3.4] The minimality claim is a central selling point of the paper ('The algorithm is optimal in the sense that the set of axioms used is minimal'), but Remark 3.4 merely asserts that removing any of (kr0)-(kr3) results in a structure that is no longer a hyperfield. No proof or explicit counterexample family is supplied for any of the four axioms. Since this claim concerns load-bearing advertising of the algorithm, it needs a proof or, at minimum, a concise demonstration for each axiom showing a family satisfying the other three conditions that is not a hyperfield. Note also that in the cyclic setting of Section 4, (kr3) is automatic, so if minimality for the implemented algorithm is intended, a separate statement about the minimality of (kr0), (kr1), (kr2) for cyclic cones is needed.
  3. [Theorem 4.3, proof] The displayed computation establishing (kr3) ends with '= a^l A_{a^{k-l}} = y A_{y^{-1}x} = x A_{x y^{-1}}'. The last equality, if read literally, is incorrect: x A_{x y^{-1}} with x=a^k equals a^k A_{a^{k-l}}, not a^l A_{a^{k-l}} in general. The intended chain is presumably '= A_{x y^{-1}} y', which would complete the proof because the multiplication group is abelian. This is a typographical issue in a proof, but it should be fixed so that the proof of the redundancy of (kr3) is unambiguous.
minor comments (4)
  1. [Algorithm 5 and Algorithm 6] In Algorithm 5, the loop variable in 'for all k in Sum(i,l)' shadows the input parameter k, and the set being accumulated is not clearly connected to the positive part of a^k - a^l. In Algorithm 6, the loop 'for all l in Sum(i,k)' similarly shadows the input parameter l. Renaming the loop variables would make the pseudocode much easier to check.
  2. [Algorithm 16] The line 'Tab[i][N] <- new Entries(-2N-1-i, false, 0)' appears to contain a notational error: the encoding of a singleton negative subset should presumably involve -(2^i) or a similar bit-mask expression, not the subtraction of an index from a constant. This should be corrected or clarified.
  3. [Section 5, equation (8)] The sentence 'is the inverse mapping to (5)' refers to an equation number that does not exist; the intended reference is likely equation (4) or the preceding display.
  4. [Introduction and Section 6] The introduction says the complete classification covers hyperfields 'of cardinality up to 13', while the abstract and Table 6.1 report orders up to 15 (N=7). This inconsistency should be resolved. In addition, the transition from Table 6.1 (which includes C-char 1 and 2 counts) to Table 6.2 (which lists only C-char 3 for N=8) should explicitly state that C-char 1 and 2 cases for N=8 are excluded by the stated restriction, rather than being absent.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the construction and enumeration are self-contained; reported counts come from checking axioms, not from fitted inputs.

full rationale

No circular step meets the required standard: the derivation is not equivalent to its inputs. Theorem 3.3 proves that every real hyperfield can be generated by the family A_x = 1+x and that conditions (kr0)-(kr3) suffice; Theorem 4.3 shows that, for cyclic positive cones, step b makes (kr3) automatic, so the exhaustive enumeration checks exactly (kr0)-(kr2) plus the even-N condition. Algorithm 14 iterates over the (K+1)-tuples whose completeness is proved in Corollary 4.2; no parameter is fitted to the reported counts and no 'prediction' is a renamed input. Theorem 2.20 is a self-citation from the authors' earlier paper [13], but it is an independently proved criterion applied only to interpret computed C-characteristics, not a premise adjusted to force the classification; it does not make the central derivation circular. The paper's weaknesses are non-circular: Section 6 restricts the N=8 search to C-characteristic >2 without describing an exhaustive optimized search or proving that no hyperfields of higher C-characteristic occur, and Remark 3.4 asserts minimality of the axiom set without supplying the required independence examples. These are completeness and reproducibility concerns, not self-definitional or fitted-input circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The paper introduces no free parameters and no new entities. It relies on standard hyperfield definitions, a prior criterion for non-Krasner quotient hyperfields, and an unverified completeness assumption for the order-17 search.

assumptions (3)
  • domain assumption External criterion Theorem 2.20: a finite hyperfield with characteristic 0 and C-characteristic >1 is not a Krasner quotient hyperfield.
    Quoted from [13] in Section 2 and used in Section 6 to classify generated hyperfields as non-Krasner; not reproved here.
  • domain assumption Every finite real hyperfield has characteristic 0.
    Used to apply Theorem 2.20 to real hyperfields; stated in the abstract and Remark 2.19 as a known fact.
  • ad hoc to paper The N=8 search restricted to C-characteristic greater than 2 is exhaustive.
    Section 6 imposes this restriction for N=8 but does not describe the optimized search or prove completeness; the brute-force Algorithm 14 cannot reach this size.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Algorithmic Construction of Real Hyperfields from Minimal Axioms." pith.science (2026). https://pith.science/paper/62DC5WBG

@misc{pith2026250819418,
  author       = {Pith},
  title        = {Pith review of: Algorithmic Construction of Real Hyperfields from Minimal Axioms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/62DC5WBG}},
  note         = {Machine review of arXiv:2508.19418}
}
read the original abstract

We study real hyperfields, focusing in particular on those that are finite with cyclic positive cones. All real hyperfields have characteristic zero, although they can still be classified using the C-characteristic, an invariant that captures essential structural information. We present an algorithm to determine all such hyperfields up to isomorphism and compute their C-characteristic. The algorithm is optimal in the sense that the set of axioms used is minimal. We develop and implement this algorithm in software, enabling a complete classification of finite real hyperfields with cyclic positive cones of order up to 15, as well as identification of the C-characteristic that occur in such hyperfields of order up to 17. Restricting attention to finite hyperfields of cyclic positive cones enables substantial simplification of the algorithm, thereby enhancing its computational efficiency and allowing for the rapid generation of hyperfields of large order. Using a criterion that allows us to determine whether a given finite real hyperfield is a Krasner quotient hyperfield, we obtain many new examples of hyperfields that do not arise from Krasner's quotient construction.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

29 extracted references · 27 canonical work pages

  1. [1]

    Ameri, M, Eyv azi, S

    R. Ameri, M, Eyv azi, S. Hoskov a-Mayerov a , Advanced results in enumeration of hyperfields, AIMS Math 5(6) (2020) 6552-6579

    work page 2020

  2. [2]

    Anderson, J

    L. Anderson, J. F. Da vis , Hyperfield grassmannians, Advances in Mathematics 341 (2019) 336-366

    work page 2019

  3. [3]

    Baker, T

    M. Baker, T. Jin , On the structure of hyperfields obtained as quotients of fields, Proceedings of the American Mathematical Society 149(1) (2021) 63-70

    work page 2021

  4. [4]

    Baker, N

    M. Baker, N. Bowler , Matroids over partial hyperstructures, Advances in Mathematics 343 (2019) 821- 863

    work page 2019

  5. [5]

    Bowler, T

    N. Bowler, T. Su , Classification of doubly distributive skew hyperfields and stringent hypergroups, Journal of Algebra 574 (2021) 669-698

    work page 2021

  6. [6]

    Connes, C

    A. Connes, C. Consani , The hyperring of adele classes, Journal of Number Theory 131(2) (2011) 159-194

    work page 2011

  7. [7]

    Eppolito, J

    C. Eppolito, J. Jun, M. Szczesny , Hopf algebras for matroids over hyperfields, Journal of Algebra 556 (2020) 806-835

    work page 2020

  8. [8]

    On Characteristics of Hyperfields Obtained as Quotients of Finite Fields

    A, Frigo, H. Lheem, D. Liu , On Characteristics of Hyperfields Obtained as Quotients of Finite Fields, arXiv:1810.04035, 2018

    work page Pith review arXiv 2018

Show all 29 references
  1. [9]

    Gładki, M

    P. Gładki, M. Marshall , Orderings and signatures of higher level on multirings and hyperfields, Journal of K-Theory 10(3) (2012) 489-518

    2012

  2. [10]

    Gładki, M

    P. Gładki, M. Marshall , Witt equivalence of function fields over global fields, Transactions of the Amer- ican Mathematical Society 369(11) (2017) 7861-7881

    2017

  3. [11]

    Jun, Algebraic geometry over hyperrings, Advances in Mathematics 323 (2018) 142-192

    J. Jun, Algebraic geometry over hyperrings, Advances in Mathematics 323 (2018) 142-192

    2018

  4. [12]

    Jun, Geometry of hyperfields, Journal of Algebra 569 (2021) 220-257

    J. Jun, Geometry of hyperfields, Journal of Algebra 569 (2021) 220-257

    2021

  5. [13]

    D. E. Kędzierski, A. Linzi, H. Stojałowska , Characteristic, C-characteristic and positive cones in hyperfields, Mathematics 11(3) (2023) 779

    2023

  6. [14]

    D. E. Kędzierski, K. Kuhlmann, H. Stojałowska Database for real hyperfields algorithm, Zenodo https://zenodo.org/records/16737218

  7. [15]

    Krasner, A class of hyperrings and hyperfields, International Journal of Mathematics and Mathematical Sciences 6 (1983) 307-311

    M. Krasner, A class of hyperrings and hyperfields, International Journal of Mathematics and Mathematical Sciences 6 (1983) 307-311

    1983

  8. [16]

    Krasner, Approximation des corps valués complets de caractéristiquep ̸= 0 par ceux de caractéristique 0, Colloque d’Algébre Supérieure, Bruxelles, 1956

    M. Krasner, Approximation des corps valués complets de caractéristiquep ̸= 0 par ceux de caractéristique 0, Colloque d’Algébre Supérieure, Bruxelles, 1956

    1956

  9. [17]

    Kuhlmann, A

    K. Kuhlmann, A. Linzi, H. Stojałowska , Orderings and valuations in hyperfields, Journal of Algebra 611 (2022) 399-421

    2022

  10. [18]

    Lee, Hyperfields, truncated DVRs, and valued fields, Journal of Number Theory 212 (2020) 40-71

    J. Lee, Hyperfields, truncated DVRs, and valued fields, Journal of Number Theory 212 (2020) 40-71

    2020

  11. [19]

    Linzi, Valuations on Structures More General Than Fields, Computer Sciences and Mathematics Forum MDPI 7(1)(2023) 2

    A. Linzi, Valuations on Structures More General Than Fields, Computer Sciences and Mathematics Forum MDPI 7(1)(2023) 2

    2023

  12. [20]

    Linzi, P

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

    2022 arXiv

  13. [21]

    Lorscheid , Tropical geometry over the tropical hyperfield, Rocky Mountain Journal of Mathematics 52(1) (2022) 189-222

    O. Lorscheid , Tropical geometry over the tropical hyperfield, Rocky Mountain Journal of Mathematics 52(1) (2022) 189-222

    2022

  14. [22]

    Massouros, Methods of constructing hyperfields, International Journal of Mathematics and Mathemat- ical Sciences 8 (1985) 725-728

    C. Massouros, Methods of constructing hyperfields, International Journal of Mathematics and Mathemat- ical Sciences 8 (1985) 725-728

    1985

  15. [23]

    Massouros, G

    C. Massouros, G. Massouros , On the borderline of fields and hyperfields, part II – Enumeration and classification of the hyperfields of order 7, arXiv:2412.11331, 2024

    2024 arXiv

  16. [24]

    Massouros, C

    G. Massouros, C. Massouros , Hypercompositional algebra, computer science and geometry, Mathematics 8(8) (2020) 1338

    2020

  17. [25]

    Massouros, On the attached hypergroups of the order of an automation, Journal of Discrete Mathe- matical Sciences and Cryptography, 6(2-3) (2003) 207-215

    G. Massouros, On the attached hypergroups of the order of an automation, Journal of Discrete Mathe- matical Sciences and Cryptography, 6(2-3) (2003) 207-215

    2003

  18. [26]

    Marshall, Real reduced multirings and multifields, Journal of Pure and Applied Algebra 205(2) (2006) 452-468 ALGORITHMIC CONSTRUCTION OF REAL HYPERFIELDS FROM MINIMAL AXIOMS 31

    M. Marshall, Real reduced multirings and multifields, Journal of Pure and Applied Algebra 205(2) (2006) 452-468 ALGORITHMIC CONSTRUCTION OF REAL HYPERFIELDS FROM MINIMAL AXIOMS 31

    2006

  19. [27]

    Maxwell, B

    J. Maxwell, B. Smith , Convex geometry over ordered hyperfields, arXiv:2301.12760, 2023

    2023

  20. [28]

    Mittas, Sur les hyperanneaux et les hypercorps, Mathematica Balkanica 3 (1973) 368-382

    J. Mittas, Sur les hyperanneaux et les hypercorps, Mathematica Balkanica 3 (1973) 368-382

    1973

  21. [29]

    Viro, Hyperfields for tropical geometry I

    O. Viro, Hyperfields for tropical geometry I. Hyperfields and dequantization, arXiv:1006.3034, 2010

    2010 arXiv

Pith tools

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