Please use this identifier to cite or link to this item: http://hdl.handle.net/10174/37964

Title: Towards an enumeration of finite common meadows
Authors: Dinis, Bruno
Dias, João
Editors: Jorge, Almeida
Keywords: Finite meadows
Finite rings
lattices
enumeration
partition
Issue Date: 2024
Publisher: World Scientific Publishing Company
Citation: Dias J., Dinis, B. - Towards an enumeration of finite common meadows, International Journal of Algebra and Computation Vol. 34, No. 06, pp. 837-855 (2024) doi: 10.1142/S0218196724500310.
Abstract: Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term a which is absorbent for addition. We study the problem of enumerating all finite common meadows of order n (that is, common meadows with n elements). This problem turns out to be deeply connected with both the number of finite rings of order n and with the number of a certain kind of partition of positive integers.
URI: https:///dx.doi.org/10.1142/S0218196724500310
http://hdl.handle.net/10174/37964
Type: article
Appears in Collections:CIMA - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica

Files in This Item:

File Description SizeFormat
S0218196724500310.pdf538.32 kBAdobe PDFView/OpenRestrict Access. You can Request a copy!
FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpaceOrkut
Formato BibTex mendeley Endnote Logotipo do DeGóis 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Dspace Dspace
DSpace Software, version 1.6.2 Copyright © 2002-2008 MIT and Hewlett-Packard - Feedback
UEvora B-On Curriculum DeGois