Authors: Arnautov Vladimir, A.V.Kochina
– 0.12 Mb
Abstract
The article consists of two parts. In the first part we present an algorithm which allows to receive, for any topology τ which is given on a set X from n elements, all topologies on the set X S{y} each of which induces the topology τ on the set X. In the second part (as an example) this algorithm is applied for calculation of the number of topologies on the set Y each of which induces the discrete topology on the set X.Fulltext
– 0.12 Mb
