Towards an enumeration of finite common meadows
| dc.contributor.author | Dinis, Bruno | |
| dc.contributor.author | Dias, João | |
| dc.contributor.editor | Jorge, Almeida | |
| dc.date.accessioned | 2025-02-14T11:49:23Z | |
| dc.date.available | 2025-02-14T11:49:23Z | |
| dc.date.issued | 2024 | |
| dc.description.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. | por |
| dc.identifier.authoremail | bruno.dinis@uevora.pt | |
| dc.identifier.authoremail | joao.miguel.dias@uevora.pt | |
| dc.identifier.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. | por |
| dc.identifier.doi | 10.1142/S0218196724500310 | por |
| dc.identifier.scientificarea | 333 | por |
| dc.identifier.uri | https:///dx.doi.org/10.1142/S0218196724500310 | |
| dc.identifier.uri | http://hdl.handle.net/10174/37964 | |
| dc.language.iso | por | por |
| dc.peerreviewed | yes | por |
| dc.publisher | World Scientific Publishing Company | por |
| dc.rights | restrictedAccess | por |
| dc.subject | Finite meadows | por |
| dc.subject | Finite rings | por |
| dc.subject | lattices | por |
| dc.subject | enumeration | por |
| dc.subject | partition | por |
| dc.title | Towards an enumeration of finite common meadows | por |
| dc.type | article | por |