The convexity in the complex of multi-ary relations [Articol]

dc.contributor.authorBraguţă, Galinaro
dc.contributor.authorCataranciuc, Sergiuro
dc.date.accessioned2019-02-28T13:48:24Z
dc.date.available2019-02-28T13:48:24Z
dc.date.issued2015
dc.description.abstractFor a complex of multi-ary relations [12] it is defined the concept of (k,m)-chain which is a generalization of the concept of chain known from the graph theory. Using (k,m)- chains it is introduced the concept of the distance function and it is proved that this function generate a convexity in the complex of multi-ary relations. It is operating with the concepts of convexity and convex hull, axiomatically defined by F.Levi [29] and we describe the iterative procedure to construct a convex hull for a subset of elements from the complex of multi-ary relations. [ABSTRACT FROM AUTHOR]en
dc.identifier.citationBRĂGUȚĂ, Galina and Sergiu CATARANCIUC. The convexity in the complex of multi-ary relations. ROMAI Journal. 2015, Vol. 11, Issue 2, pp. 51-62. ISSN 1841-5512.en
dc.identifier.issn1841-5512
dc.identifier.urihttps://msuir.usm.md/handle/123456789/1975
dc.language.isoenen
dc.publisherRomanian Society of Applied & Industrial Mathematics Universitatea din Pitestien
dc.subjectconvex hullen
dc.subjectconvexityen
dc.subjectmetric spaceen
dc.titleThe convexity in the complex of multi-ary relations [Articol]en
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
BRĂGUȚĂ.pdf
Size:
93.89 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections