We consider face-to-face partitions of bounded polytopes into convex polytopes in d for arbitrary d ≥ 1 and examine their colourability. In particular, we prove that the chromatic number of any simplicial partition does not exceed d+ 1. Partitions of polyhedra in 3 into pentahedra and hexahedra are 5- and 6-colourable, respectively. We show that the above numbers are attainable, i.e., in general, they cannot be reduced.
In the article I have made an attempt to trace a development of the lexical expression of a negation phenomenon in the process of formation of Old Church Slavonic as the first medieval literary language of Slavs. An appearance of a great number of neologisms with the prefixes bez- a ne- was conditioned by the necessity to translate complicated in their content and style Greek texts. It was my intention to demonstrate the fact that the influence of the language of Greek original texts was not only in an initiation of processes of direct calque creation but also in activating the long-standing Slavic word-formation models.
The paper deals with applicability of the program SNAP on drive systems analyses. That program should be utilized especially in education of electric and mechatronic drive experts. and Obsahuje seznam literatury