.png){kind=icon}
.png){kind=icon}
Return
Convolution lattices
.png){kind=icon}
OA
AI
DOI：10.1016/j.fss.2017.04.017.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose two convolution operations on the set of functions between two bounded lattices and investigate the algebraic structure they constitute, in particular the lattice laws they satisfy. Each of these laws requires the restriction to a specific subset of functions, such as normal, idempotent or convex functions. Combining all individual results, we identify the maximal subsets of functions resulting in a bounded lattice, and show this result to be equivalent to the distributivity of the lattice acting as domain of the functions. Furthermore, these lattices turn out to be distributive as well. Additionally, we show that for the larger subset of idempotent functions, although not satisfying the absorption laws, the convolution operations satisfy the Birkhoff equation. (c) 2017 Elsevier B.V. All rights reserved.
Keywords:
Algebra
Convolution operations
Lattice
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
7.6K
Citations:
1.5W
