dc.contributor.author | NEGRU, Ion | |
dc.date.accessioned | 2020-11-05T22:23:00Z | |
dc.date.available | 2020-11-05T22:23:00Z | |
dc.date.issued | 2018 | |
dc.identifier.citation | NEGRU, Ion. On a Certain Property of the Elements of a Finitely Generated Lattice. In: CAIM 2018: The 26th Conference on Applied and Industrial Mathematics: Book of Abstracts, Technical University of Moldova, September 20-23, 2018. Chişinău: Bons Offices, 2018, pp. 98-99. | en_US |
dc.identifier.uri | http://repository.utm.md/handle/5014/11174 | |
dc.description | Only Abstract | en_US |
dc.description.abstract | 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 defined thusly: the generating elements of the lattice are given. Other elements, different from the generators, are obtained via the two lattice operations, applied to the generators. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Bons Offices | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | generated lattices | en_US |
dc.subject | elements | en_US |
dc.subject | lattice generators | en_US |
dc.subject | method of mathematical induction | en_US |
dc.subject | properties | en_US |
dc.title | On a Certain Property of the Elements of a Finitely Generated Lattice | en_US |
dc.type | Article | en_US |
The following license files are associated with this item: