In this note we use some simple counting arguments to show that an almost partial geometry is always symmetric.
A note on partial numberings
β Scribed by Serikzhan Badaev; Dieter Spreen
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 127 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
Dedicated to Klaus Weihrauch on the occasion of his 60th birthday.
The different behaviour of total and partial numberings with respect to the reducibility preorder is investigated. Partial numberings appear quite naturally in computability studies for topological spaces. The degrees of partial numberings form a distributive lattice which in the case of an infinite numbered set is neither complete nor contains a least element. Friedberg numberings are no longer minimal in this situation. Indeed, there is an infinite descending chain of non-equivalent Friedberg numberings below every given numbering, as well as an uncountable antichain.
π SIMILAR VOLUMES
## Abstract A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of interest. His work relies on continuous methods. In this note we make some simple observations that lead to a purely combinatorial treatment. Our methods yield sho
## Abstract The __book with n pages__ __B__~__n__~ is the graph consisting of __n__ triangles sharing an edge. The __book Ramsey number__ __r__(__B__~__m__~,__B__~__n__~) is the smallest integer __r__ such that either __B__~__m__~βββ__G__ or __B__~__n__~βββ__G__ for every graph __G__ of order __r__