Compatible Algebras with Straightening Laws on Distributive Lattices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Straightening Laws on Modules and Their Symmetric Algebras

Several modules M over algebras with straightening law A have a structure which is similar to the structure of A itself: M has a system of generators endowed with a natural partial order, a standard basis over the ring B of coefficients, and the multiplication A × M → A satisfies a “straightening law”. We call them modules with straightening law, briefly MSLs. In section 1 we recall the notion ...

متن کامل

Distributive Congruence Lattices of Congruence-permutable Algebras

We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...

متن کامل

Boolean Algebras and Distributive Lattices Treated Constructively

Some aspects of the theory of Boolean algebras and distributive lattices -in particular, the Stone Representation Theorems and the properties of filters and ideals -are analyzed in a constructive setting.

متن کامل

On the Relationship between Projective Distributive Lattices and Boolean Algebras

The main result of this paper is the following theorem: If a projective Boolean algebra B is generated by its sublattice L, then there is a projective distributive lattice D which is a sublattice of L and generates B.

متن کامل

A NOTE ON CONGRUENCE LATTICES OF DISTRIBUTIVE p–ALGEBRAS

A (distributive) p-algebra is an algebra 〈L;∨,∧, ∗, 0, 1〉 whose reduct 〈L;∨,∧, 0, 1〉 is a bounded (distributive) lattice and whose unary operation ∗ is characterized by x ≤ a if and only if a ∧ x = 0. If L is a p-algebra, B(L) = { x ∈ L : x = x } and D(L) = { x ∈ L : x = 1 } then 〈B(L);∪,∧, 0, 1〉 is a Boolean algebra when a ∪ b is defined to be (a∗ ∧ b∗)∗, for any a, b ∈ B(L), D∗(L) = { x ∨ x∗ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2019

ISSN: 2227-7390

DOI: 10.3390/math7080671