Вычислительные методы и приложения
Bijective coding in the constructive world of $\mathbb R_c^n$
G. G. Ryabov, V. A. Serov
M.V. Lomonosov Moscow State University, Research Computing Center
The methods of representation of structures in the standard cubic lattice $\mathbb R_c^n$ in the form of bijective coding on a finite alphabet are developed. These methods are directed on an efficient computer implementation during the storage and computation of topological, metric and combinatorial performances of such structures for large values of $n$. The Hausdorff–Hamming metric for $k$-faces on an $n$-cube is extended to the Gromov-Hausdorff metric between “cubic” metric spaces. Simplicial partitions in an $n$-cube, their bijective coding, and ergodic properties are considered. Combinatorial filling at partitions on $\mathbb R_c^n$ and related numerical performances are considered with respect to capabilities of supercomputers.
n-cube; lattice $\mathbb R_c^n$; bijective coding; Gromov-Hausdorff metric; simplicial partitions; combinatorial filling.
PDF file (442 kB)
512.531; 515.124; 004.2
G. G. Ryabov, V. A. Serov, “Bijective coding in the constructive world of $\mathbb R_c^n$”, Vychisl. Metody Programm., 13:3 (2012), 465–470
Citation in format AMSBIB
\by G.~G.~Ryabov, V. A. Serov
\paper Bijective coding in the constructive world of $\mathbb R_c^n$
\jour Vychisl. Metody Programm.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|