Density and Baire category in recursive topology
โ Scribed by Iraj Kalantari; Larry Welch
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 178 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
We develop the concepts of recursively nowhere dense sets and sets that are recursively of first category and study closed sets of points in light of Baire's Category Theorem. Our theorems are primarily concerned with exdomains (i. e. complements of domains) of recursive quantum functions and hence with avoidable points (i. e. points that can be forced into exdomains of recursive quantum functions). An avoidance function is a recursive function which can be used to expel avoidable points from domains of recursive quantum functions. We define an avoidable set of points to be an arbitrary subset of the avoidable points of a single avoidance function, and we study an effective union of such sets which we call a piecemeal avoidable set. We note that each of โthe set of recursive pointsโ and โthe set of avoidable pointsโ is of first category but not recursively of first category. We show an exdomain exists which is recursively nowhere dense, as well as one that is nowhere dense but not recursively nowhere dense. After establishing that every exdomain is recursively of first category, we prove that given any fixed exdomain, there is another exdomain, which while dense in the underlying space, is disjoint from the fixed exdomain. Finally, we show how to build a recursive sequence of recursive quantum functions that have mutually disjoint, dense exdomains. (ยฉ 2004 WILEYโVCH Verlag GmbH & Co. KGaA, Weinheim)
๐ SIMILAR VOLUMES
## Abstract The growing activity in the area of Quantum Chemical Topology warrants a new algorithm to delineate topological basins in 3D scalar fields other than the electron density. A method based on the โoctal tree search algorithmโ of computer graphics is proposed to reach this goal. We illustr
Recently, surveillance, security, patrol, search, and rescue applications increasingly require algorithms and methods that can work automatically in real time. This paper reports a new real-time approach based on three novel techniques for automatic detection, object identification, and tracking in