RO EN
Method for constructing one-point expansions of a topology* on a finite set and its applications
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
Contents
- Generalized hypergeometric systems and the fifth and sixth Painlev´e equations
- Vague BF-algebras
- A heuristic algorithm for the two-dimensional single large bin packing problem
- On isotopy, parastrophy and orthogonality of quasigroups
- On stability of Pareto-optimal solution of portfolio optimization problem with Savages minimax risk criteria
- On quasiidenties of torsion free nilpotent loops
- Center problem for a class of cubic systems with a bundle of two invariant straight lines and one invariant conic
- Method for constructing one-point expansions of a topology* on a finite set and its applications
- Topological rings with at most two nontrivial closed ideals
- Convex Quadrics
- On spaces related to the Navier-Stokes equations
