On a Certain Property of the Elements of a Finitely Generated Lattice
Închide
Articolul precedent
Articolul urmator
257 1
Ultima descărcare din IBN:
2024-02-09 03:21
SM ISO690:2012
NEGRU, Ion. On a Certain Property of the Elements of a Finitely Generated Lattice. In: Conference on Applied and Industrial Mathematics: CAIM 2018, 20-22 septembrie 2018, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2018, Ediţia a 26-a, pp. 98-99. ISBN 978-9975-76-247-2.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Conference on Applied and Industrial Mathematics
Ediţia a 26-a, 2018
Conferința "Conference on Applied and Industrial Mathematics"
Iași, România, Romania, 20-22 septembrie 2018

On a Certain Property of the Elements of a Finitely Generated Lattice


Pag. 98-99

Negru Ion
 
Technical University of Moldova
 
 
Disponibil în IBN: 1 iunie 2022


Rezumat

Firstly, a reminder that a lattice is a set S of elements; it is partially ordered, closed in relation to two lattice operations: the reunion a + b and the intersection a  b of any two elements a and b from set S. (The reunion a + b is the smallest element of the lattice containing both elements a and b; the intersection a  b is the greatest element of the lattice contained in both elements a and b. Obviously, a  a + b; b  a + b; a  a  b; b  a  b) A lattice may also be de ned thusly: the generating elements of the lattice are given. Other elements, di erent from the generators, are obtained via the two lattice operations, applied to the generators.