Abstract
The Hausdorff metric on all faces of the unit n-cube (In) is considered. The notion of a cubant is used; it was introduced as an n-digit quaternary code of a k-dimensional face containing the Cartesian product of k frame unit segments and the face translation code within In. The cubants form a semigroup with a unit (monoid) with respect to the given operation of multiplication. A calculation of Hausdorff metric based on the generalization of the Hamming metric for binary codes is considered. The supercomputing issues are discussed.
Similar content being viewed by others
References
M. Deza and M. I. Shtogrin, “Mosaics and their isometric embeddings,” Izv. Ross. Akad. Nauk, Ser. Mat., 66, No. 3, 3–22 (2002).
G. G. Ryabov, “On the path coding of k-faces in an n-cube,” Vychisl. Metody Program., 9, No. 1, 20–22 (2008).
G. G. Ryabov, “On the quaternary coding of cubic structures,” Vychisl. Metody Program., 10, No. 2, 154–161 (2009).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 16, No. 1, pp. 151–155, 2010.
Rights and permissions
About this article
Cite this article
Ryabov, G.G. Hausdorff metric on faces of the n-cube. J Math Sci 177, 619–622 (2011). https://doi.org/10.1007/s10958-011-0487-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-011-0487-3