Towards an enumeration of finite common meadows

DOI10.1142/S0218196724500310MaRDI QIDQ6633828zbMATH OpenFDO

Authors João Dias, Bruno Dinis

Publication date 6 November 2024

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218196724500310

zbMATH Keywords

enumerationfinite meadowsfinite ringslatticespartitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Representation theory of lattices (06B15) Finite commutative rings (13M99) Generalized inverses (associative rings and algebras) (16U90)

Cites work

• Arithmetical datatypes with true fractions
• Division by zero in common meadows
• Fields, Meadows and Abstract Data Types
• scientific article; zbMATH DE number 5272192 (Why is no real title available?)
• Logical Approaches to Computational Barriers
• SWAC Computes 126 Distinct Semigroups of Order 4
• The rational numbers as an abstract data type
• The semigroups of order 9 and their automorphism groups.
• The structure of finite meadows

Cited in

(2)

• Bridging meadows and sheaves
• Logical models of mathematical texts. II: legality conventions for division by zero in inconsistent contexts

This page was built for publication: Towards an enumeration of finite common meadows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633828)