A sequence of positive integers with positive lower density contains a Hilbert (or combinatorial) cube size c log log n up to n. We prove that c log log n cannot be replaced by c$ -log n log log n. ## 1999 Academic Press In [1] D. Hilbert showed (using different terminology) that for any k 1, if N
On ambient embeddings in the Hilbert cube
β Scribed by David G. Wright
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 280 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0166-8641
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that for each countable Abelian group G and for each natural number n there exists an absorbing set in the Hilbert cube for the class of strongly finite-dimensional (in the sense of covering dimension) spaces X with dimG X < n. 0 1997 Elsevier Science B.V.
## Abstract We classify all the embeddings of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {P}\_n$\end{document} in a Grassmannian __Gr__(1, __N__) such that the composition with the PlΓΌcker embedding is given by a linear system of cubics on \documentclass{ar