Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Complex of abstract cubes and median problem
Authors: Sergiu Cataranciuc, Petru Soltan
Keywords: Abstract cube, complex, multidimensional homogeneous tree, abstract sphere, median
– 0.25 Mb
Keywords: Abstract cube, complex, multidimensional homogeneous tree, abstract sphere, median
Abstract
In this paper a special complex Kn of abstract cubes [2, 3], which contains only n-dimensional cubes is examined. The border of this complex is an abstract (n−1)-dimensional sphere. It is proved that the abstract sphere contains at least one 0-dimensional cube, which belongs to exactly n cubes with dimension 1, if the complex is a homogeneous n-dimensional tree. This result allows to solve, in an efficient way, the problem of median for a skeleton of size 1 of the tree with weighted vertices and edges. The algorithm to calculate the median without using any metric is described. The proposed algorithm can be applied with some modifications, for arbitrary complex of abstract cubes.Moldova State University
E-mail: ,
E-mail: ,
Fulltext
– 0.25 Mb
Contents
- Multiset-based Tree Model for Membrane Computing
- Maximal induced colorable subhypergraphs of all uncolorable BSTS (15)s
- Complex of abstract cubes and median problem
- About one algorithm of bidimensional interpolation using splines
- Optimal Correction of Infeasible Systems in the Second Order Conic Linear Setting
- Blind Collective Signature Protocol
- Architecting software concurrency
