Distinguishing Subsets of Lattices
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F09%3APU85124" target="_blank" >RIV/00216305:26220/09:PU85124 - isvavai.cz</a>
Alternative codes found
RIV/63468352:_____/09:#0000038
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Distinguishing Subsets of Lattices
Original language description
This paper links the papers [7],[8] and [9] in which were considered the concepts of distinguishing subsets of groups, monoids, semigroups and join-semilattices. J. Nieminen studied the distinguishing subsets of join-semilattices with the aid of meet-irreducible elements [2].This paper continues in this direction. The lattice considered here will be finite but some results can be immediately generalized for the semi-discrete lattices i.e. for the lattices where among all comparable elements there existsa finite maximal chain and for lattices satisfying the maximum chain condition.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
XXVIIth International Colloquium on the Management of Educational Process
ISBN
978-80-7231-650-2
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
—
Publisher name
FEM UNOB
Place of publication
Brno
Event location
Brno
Event date
May 21, 2009
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000271552100022