Files

Download Available for download on Saturday, May 01, 2021

Download Full Text (215 KB)

Description

A commutative doubly-idempotent semiring (cdi-semiring) (S,V,·,0,1) is a semilattice (S,V,0) with x V 0 = x and a semilattices (S,·,1) with identity 1 such that x0 = 0, and x(y V z) = xy V xz holds for all x, y, z ϵ S. Bounded distributive lattices are cdi-semirings that satisfy xy = x ^ y, and the variety of cdi-semirings covers the variety of bounded distributive lattices. Chajda and Länger showed in 2017 that the variety of all cdi-semirings is generated by a 3-element cdi-semiring. We show that there are seven cdi-semirings with a V-semilattice of height less than or equal to 2. We construct all cdi-semirings for which their multiplicative semilattice is a chain with n + 1 elements, and we show that up to isomorphism the number of such algebras is the nth Catalan number Cn = (1/(n+1)) (2n/n ) . We also show that cdi-semirings with a complete atomic Boolean V-semilattice on the set of atoms A are determined by singleton-rooted preorder forests on the set A. From these results we obtain efficient algorithms to construct all multiplicatively linear cdisemirings of size n and all Boolean cdi-semirings of size 2n.

ISBN

978-3-030-43520-2

Publication Date

4-2020

Publisher

Springer

Keywords

idempotent semirings, distributive lattices, preorder forests

Disciplines

Algebra

Comments

In Uli Fahrenberg, Peter Jipsen, and Michael Winter (Eds.), Relational and Algebraic Methods in Computer Science: 18th International Conference, RAMiCS 2020, Palaiseau, France, April 8–11, 2020, Proceedings.

Copyright

Springer

Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests

Included in

Algebra Commons

Share

COinS