Distributive lattices of subspaces and the equality problem for algebras with a single relation

1976 ◽  
Vol 15 (4) ◽  
pp. 238-274 ◽  
Author(s):  
V. N. Gerasimov
Author(s):  
U. M. Swamy ◽  
Ch. Santhi Sundar Raj ◽  
A. Natnael Teshale

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Shijie Sun ◽  
Meiling Feng ◽  
Luoyi Shi

Abstract This paper considers an iterative algorithm of solving the multiple-sets split equality problem (MSSEP) whose step size is independent of the norm of the related operators, and investigates its sublinear and linear convergence rate. In particular, we present a notion of bounded Hölder regularity property for the MSSEP, which is a generalization of the well-known concept of bounded linear regularity property, and give several sufficient conditions to ensure it. Then we use this property to conclude the sublinear and linear convergence rate of the algorithm. In the end, some numerical experiments are provided to verify the validity of our consequences.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Wesley Fussner ◽  
Mai Gehrke ◽  
Samuel J. van Gool ◽  
Vincenzo Marra

Abstract We provide a new perspective on extended Priestley duality for a large class of distributive lattices equipped with binary double quasioperators. Under this approach, non-lattice binary operations are each presented as a pair of partial binary operations on dual spaces. In this enriched environment, equational conditions on the algebraic side of the duality may more often be rendered as first-order conditions on dual spaces. In particular, we specialize our general results to the variety of MV-algebras, obtaining a duality for these in which the equations axiomatizing MV-algebras are dualized as first-order conditions.


Order ◽  
2021 ◽  
Author(s):  
Peter Köhler

AbstractThe paper presents a method of composing finite distributive lattices from smaller pieces and applies this to construct the finitely generated free distributive lattices from appropriate Boolean parts.


Author(s):  
Gezahagne Mulat Addis

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.


Sign in / Sign up

Export Citation Format

Share Document