All Subdirectly Irreducible BDLC-Algebras

Charoenpol, A.; Ratanaprasert, C.

doi:10.17654/ms100030477

Search citation statements

Order By: Relevance

Paper Sections

Select...

Preliminaries2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, if A is the 2-element chain then we call it that an n-cube BDLC-algebra, denoted by 2 * n . In [2], Charoenpol and Ratanaprasert proved the following facts.…”

Section: Preliminariesmentioning

confidence: 88%

See 1 more Smart Citation

A pre-period of a finite distributive lattice

Charoenpol¹,

Chotwattakawanit²

2023

Discuss. Math. - General Algebra and Applications

View full text Add to dashboard Cite

The notion of a pre-preriod of a finite bounded distributive lattice (BDL) A is defined by means of the notion of a pre-period of a finite connected monounary algebra: it is the maximum value of the pre-period of an endomorphism and 0-fixing connected mapping of A to A. The main result is that the pre-period of any finite BDL is less than or equal to the length of the lattice; also, necessary and sufficient conditions under which it is equal to the length of the lattice, are shown.

show abstract

“…In particular, if A is the 2-element chain then we call it that an n-cube BDLC-algebra, denoted by 2 * n . In [2], Charoenpol and Ratanaprasert proved the following facts.…”

Section: Preliminariesmentioning

confidence: 88%

“…Theorem 2 [2]. Let A = A; ∨, ∧, f, 0, 1 be a BDLC-algebra with λ(f ) = n. The following are equivalent:…”

Section: Preliminariesmentioning

confidence: 99%