# Search results

**Create the page "Book" on this wiki!** See also the search results found.

## Page title matches

- <strong>[[Houston Problem Book Problem 6|Problem 6]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[chainable]] [[continuum]] be [[embed|e504 bytes (72 words) - 22:23, 30 December 2015
- ...ed the problems in the [http://web.mst.edu/~ingram/hpb.pdf Houston Problem Book] here.<ref>Cuchta, Tom. 2015. [http://tomcuchta.com/]</ref> | [[The Houston Problem Book Problems 1-50|The Houston Problem Book Problem Set]]1 KB (128 words) - 05:30, 30 November 2018
- {{Book|Hyperspaces, Fundamentals and Recent Advances|1999|Marcel Dekker||Alejandro [[Category:Book]]8 KB (903 words) - 04:32, 21 December 2017
- <strong>[[Houston Problem Book Problem 2|Problem 2]] ([[The Houston Problem Book|HPB]]): </strong> Suppose $X$ is a [[continuum]] such that for each positiv713 bytes (99 words) - 01:51, 26 November 2016
- <strong>[[Houston Problem Book Problem 1|Problem 1]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] which cannot be [[Embedding547 bytes (75 words) - 01:07, 27 June 2016
- <strong>[[Houston Problem Book Problem 19|Problem 19]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[strictly non-mutually aposyndetic]] [[continuu561 bytes (69 words) - 02:22, 31 December 2015
- <strong>[[Houston Problem Book Problem 17|Problem 17]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[topological space]] $(X,\tau)$ on which the [490 bytes (63 words) - 01:40, 31 December 2015
- <strong>[[Houston Problem Book Problem 15|Problem 15]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open mapping]] of a [[compact621 bytes (89 words) - 23:34, 30 December 2015
- <strong>[[Houston Problem Book Problem 13|Problem 13]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[product]] of two [[strongly Hurewicz]] [[metric s398 bytes (49 words) - 22:58, 30 December 2015
- <strong>[[Houston Problem Book Problem 11|Problem 11]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[strongly Hurewicz]] space an [[absolute F sigma|483 bytes (64 words) - 22:49, 30 December 2015
- <strong>[[Houston Problem Book Problem 5|Problem 5]] ([[The Houston Problem Book|HPB]]):</strong> Can every [[hereditarily decomposable]] [[Chainable contin521 bytes (67 words) - 01:57, 26 November 2016
- <strong>[[Houston Problem Book Problem 4|Problem 4]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[Suslinean]] curve, does there exist a [[coun456 bytes (59 words) - 21:52, 30 December 2015
- <strong>[[Houston Problem Book Problem 3|Problem 3]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[continuum]] such that every [[subcontinuum]]491 bytes (65 words) - 22:24, 30 December 2015
- <strong>[[Houston Problem Book Problem 9|Problem 9]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[real curve]] which can be mapped [[Su605 bytes (81 words) - 04:32, 30 November 2018
- <strong>[[Houston Problem Book Problem 8|Problem 8]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[rational]] curve which topologically457 bytes (57 words) - 22:39, 30 December 2015
- <strong>[[Houston Problem Book Problem 7|Problem 7]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[rim-type]] of any [[real curve]] (or459 bytes (61 words) - 22:29, 30 December 2015
- <strong>[[Houston Problem Book Problem 10|Problem 10]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $D$ is a [[dendroid]], $S$ is [[compact]], [[finit656 bytes (85 words) - 04:33, 30 November 2018
- <strong>[[Houston Problem Book Problem 12|Problem 12]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[product]] of two [[Hurewicz]] [[metric space|met409 bytes (51 words) - 22:56, 30 December 2015
- <strong>[[Houston Problem Book Problem 14|Problem 14]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[Lindelöf]] [[totally paracompact]] space [[Hur364 bytes (43 words) - 23:02, 30 December 2015
- <strong>[[Houston Problem Book Problem 16|Problem 16]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[locally confluent]] and [[light]] mappi637 bytes (90 words) - 23:41, 30 December 2015
- <strong>[[Houston Problem Book Problem 18|Problem 18]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[open mapping]] of a [[continuum]] $522 bytes (71 words) - 02:17, 31 December 2015
- <strong>[[Houston Problem Book Problem 20|Problem 20]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open]] [[continuous]] mapping825 bytes (131 words) - 02:54, 31 December 2015
- <strong>[[Houston Problem Book Problem 21|Problem 21]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[planar]] [[continuum]] which has only a fini551 bytes (73 words) - 06:01, 31 December 2015
- <strong>[[Houston Problem Book Problem 22|Problem 22]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[contin447 bytes (57 words) - 06:03, 31 December 2015
- <strong>[[Houston Problem Book Problem 23|Problem 23]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[bicomp417 bytes (49 words) - 06:04, 31 December 2015
- <strong>[[Houston Problem Book Problem 24|Problem 24]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $X$ is a [[simple tree]] and the [[widt472 bytes (68 words) - 06:06, 31 December 2015
- <strong>[[Houston Problem Book Problem 25|Problem 25]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[tree-like]] [[continuum]], its [[width]567 bytes (87 words) - 06:08, 31 December 2015
- <strong>[[Houston Problem Book Problem 26|Problem 26]] ([[The Houston Problem Book|HPB]]):</strong> Let $M$ be a [[locally compact]] [[metric space]] and $a \737 bytes (113 words) - 06:10, 31 December 2015
- <strong>[[Houston Problem Book Problem 27|Problem 27]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is an $n$-[[dimension|dimensional]] [[compact]620 bytes (93 words) - 06:12, 31 December 2015
- <strong>[[Houston Problem Book Problem 28|Problem 28]] ([[The Houston Problem Book|HPB]]):</strong> Prove that the [[Topologist's sine curve]] is not [[pseudo395 bytes (46 words) - 06:14, 31 December 2015
- <strong>[[Houston Problem Book Problem 29|Problem 29]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a $1$-[[dimension|dimensional]] [[continu424 bytes (49 words) - 06:15, 31 December 2015
- <strong>[[Houston Problem Book Problem 30|Problem 30]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ and $Y$ are [[Continuum|continua]] (or even [[683 bytes (97 words) - 04:45, 30 November 2018
- <strong>[[Houston Problem Book Problem 31|Problem 31]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[pseudo-arc]] is not [[pseudo-contrac366 bytes (43 words) - 06:18, 31 December 2015
- <strong>[[Houston Problem Book Problem 32|Problem 32]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a mapping $f$ of the [[circle]] or the [[609 bytes (85 words) - 06:59, 31 December 2015
- <strong>[[Houston Problem Book Problem 33|Problem 33]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $P$ is a subset of the positive integers with the688 bytes (104 words) - 04:42, 30 November 2018
- <strong>[[Houston Problem Book Problem 34|Problem 34]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $f$ is a [[Function|mapping]] of a [[tr519 bytes (72 words) - 04:47, 30 November 2018
- <strong>[[Houston Problem Book Problem 35|Problem 35]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[Continuum|c715 bytes (107 words) - 04:49, 30 November 2018
- <strong>[[Houston Problem Book Problem 36|Problem 36]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] and [[locally conflu575 bytes (81 words) - 07:05, 31 December 2015
- <strong>[[Houston Problem Book Problem 37|Problem 37]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $(X, \leq)$ is a finite [[Partially Ordered Set|pa904 bytes (137 words) - 04:55, 30 November 2018
- ...The Houston Problem Book|HPB]]):</strong> Suppose $X$ in [[Houston Problem Book Problem 37|HPB Problem 37]] is $A \cup B$, where $A$ and $B$ are [[closed]]506 bytes (72 words) - 08:11, 31 December 2015
- <strong>[[Houston Problem Book Problem 39|Problem 39]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a finite [[partially ordered set]] with the403 bytes (51 words) - 08:12, 31 December 2015
- <strong>[[Houston Problem Book Problem 40|Problem 40]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a nonseparating ([[locally compact]]) sub565 bytes (76 words) - 08:13, 31 December 2015
- <strong>[[Houston Problem Book Problem 41|Problem 41]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that the [[plane]] is the union of two [[disjoint]530 bytes (73 words) - 09:35, 31 December 2015
- <strong>[[Houston Problem Book Problem 42|Problem 42]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[compact]] [[metric space]] and $S$ is t609 bytes (93 words) - 09:37, 31 December 2015
- <strong>[[Houston Problem Book Problem 43|Problem 43]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a curve that is [[contractible]], or [[pseu524 bytes (66 words) - 09:39, 31 December 2015
- <strong>[[Houston Problem Book Problem 44|Problem 44]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[metric space]]; does [[superstable]] in372 bytes (46 words) - 09:40, 31 December 2015
- <strong>[[Houston Problem Book Problem 45|Problem 45]] ([[The Houston Problem Book|HPB]]):</strong> It is true that if $Y$ is an [[arcwise connected]] [[conti567 bytes (75 words) - 09:43, 31 December 2015
- <strong>[[Houston Problem Book Problem 46|Problem 46]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $Y$ is a [[compact]] [[metric space]] such that th497 bytes (66 words) - 09:44, 31 December 2015
- <strong>[[Houston Problem Book Problem 47|Problem 47]] ([[The Houston Problem Book|HPB]]):</strong> Do [[atomic mapping|atomic mappings]] preserve [[semi-apos513 bytes (61 words) - 09:46, 31 December 2015
- <strong>[[Houston Problem Book Problem 48|Problem 48]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[unicoherent]] and [[mutually aposyndetic]] [[con481 bytes (58 words) - 09:48, 31 December 2015
- <strong>[[Houston Problem Book Problem 49|Problem 49]] ([[The Houston Problem Book|HPB]]):</strong> Supppose $f$ is an [[open map|open mapping]] of a [[contin532 bytes (79 words) - 09:50, 31 December 2015
- <strong>[[Houston Problem Book Problem 50|Problem 50]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] mapping of a [[conti493 bytes (70 words) - 09:51, 31 December 2015
- <strong>[[Houston Problem Book Problem 51|Problem 51]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[polyhedron]] is a the [[weakly conf419 bytes (53 words) - 09:54, 31 December 2015
- <strong>[[Houston Problem Book Problem 52|Problem 52]] ([[The Houston Problem Book|HPB]]):</strong> Are [[strongly regular]] curves [[inverse limit|inverse li481 bytes (58 words) - 09:55, 31 December 2015
- <strong>[[Houston Problem Book Problem 53|Problem 53]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is the [[inverse limit]] of [[connected]] [[graph|g515 bytes (65 words) - 09:56, 31 December 2015
- <strong>[[Houston Problem Book Problem 54|Problem 54]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that $X$ is the [[inverse limit]] of [[connecte554 bytes (75 words) - 09:57, 31 December 2015
- <strong>[[Houston Problem Book Problem 55|Problem 55]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[continuous]] mapping of a [[continuum]] [[onto424 bytes (52 words) - 09:59, 31 December 2015
- <strong>[[Houston Problem Book Problem 56|Problem 56]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[weakly confluent]] mapping of a [[continuum]]433 bytes (53 words) - 10:00, 31 December 2015
- <strong>[[Houston Problem Book Problem 57|Problem 57]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[uniformly pathwise connected]] [[co403 bytes (47 words) - 10:01, 31 December 2015
- <strong>[[Houston Problem Book Problem 58|Problem 58]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[chainable c578 bytes (80 words) - 10:03, 31 December 2015
- <strong>[[Houston Problem Book Problem 59|Problem 59]] ([[The Houston Problem Book|HPB]]):</strong> Does a [[continuum]] with zero [[surjective span]] have [[356 bytes (43 words) - 10:04, 31 December 2015
- <strong>[[Houston Problem Book Problem 60|Problem 60]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $Y=G_1 \cup G_2$ where $G_1$ and $G_2$516 bytes (73 words) - 10:06, 31 December 2015
- <strong>[[Houston Problem Book Problem 61|Problem 61]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $\mathcal{E}$ is the class of all finite one point861 bytes (129 words) - 10:11, 31 December 2015
- <strong>[[Houston Problem Book Problem 62|Problem 62]] ([[The Houston Problem Book|HPB]]):</strong> Are all [[shape|shapes]] of [[polyhedra]] [[stable]]? (Ask347 bytes (41 words) - 10:12, 31 December 2015
- <strong>[[Houston Problem Book Problem 63|Problem 63]] ([[The Houston Problem Book|HPB]]):</strong> Given a [[polyhedron]] $P$, does there exist a polyhedron406 bytes (53 words) - 10:13, 31 December 2015
- <strong>[[Houston Problem Book Problem 64|Problem 64]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[uniformly path-connected]] [[continuum]] [[g-con379 bytes (42 words) - 10:14, 31 December 2015
- <strong>[[Houston Problem Book Problem 65|Problem 65]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[uniformly path-connected]] [[c537 bytes (74 words) - 10:15, 31 December 2015
- <strong>[[Houston Problem Book Problem 66|Problem 66]] ([[The Houston Problem Book|HPB]]):</strong> If $C$ is a [[connected]] [[Borel set|Borel subset]] of a503 bytes (65 words) - 10:16, 31 December 2015
- <strong>[[Houston Problem Book Problem 67|Problem 67]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that, if $C$ is a [[su606 bytes (84 words) - 10:18, 31 December 2015
- <strong>[[Houston Problem Book Problem 68|Problem 68]] ([[The Houston Problem Book|HPB]]):</strong> If for each [[subcontinuum]] $C$ of the [[continuum]] $X$,508 bytes (67 words) - 10:19, 31 December 2015
- <strong>[[Houston Problem Book Problem 69|Problem 69]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily indecomposable]] [[tree-like]] [[continu402 bytes (45 words) - 10:20, 31 December 2015
- <strong>[[Houston Problem Book Problem 70|Problem 70]] ([[The Houston Problem Book|HPB]]):</strong> Do [[uniquely lambda-connected|uniquely $\lambda$-connecte505 bytes (55 words) - 10:21, 31 December 2015
- <strong>[[Houston Problem Book Problem 71|Problem 71]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that $X$ is a [[continuum]] such that, if $\epsilo754 bytes (108 words) - 10:24, 31 December 2015
- <strong>[[Houston Problem Book Problem 72|Problem 72]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn443 bytes (53 words) - 10:25, 31 December 2015
- <strong>[[Houston Problem Book Problem 73|Problem 73]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn474 bytes (58 words) - 10:26, 31 December 2015
- <strong>[[Houston Problem Book Problem 74|Problem 74]] ([[The Houston Problem Book|HPB]]):</strong> Let $f$ be a [[perfect]] [[pseudo-confluent]] mapping of a702 bytes (85 words) - 10:29, 31 December 2015
- <strong>[[Houston Problem Book Problem 75|Problem 75]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] which poss617 bytes (85 words) - 10:30, 31 December 2015
- <strong>[[Houston Problem Book Problem 76|Problem 76]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] such that,535 bytes (82 words) - 10:31, 31 December 2015
- <strong>[[Houston Problem Book Problem 77|Problem 77]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[continuum]] $X$ is [[regular]] if and459 bytes (62 words) - 10:32, 31 December 2015
- <strong>[[Houston Problem Book Problem 78|Problem 78]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[decomposition]] of a [[finitel521 bytes (65 words) - 10:34, 31 December 2015
- <strong>[[Houston Problem Book Problem 79|Problem 79]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that no [[biconnected]] set with a [[dispersion423 bytes (53 words) - 10:35, 31 December 2015
- <strong>[[Houston Problem Book Problem 80|Problem 80]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[separable]] [[metric space]] is [[embe543 bytes (70 words) - 10:36, 31 December 2015
- Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 1}}<br />2 KB (263 words) - 03:52, 30 November 2018
- <strong>[[Houston Problem Book Problem 81|Problem 81]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[continuum]] of [[span zero]] [[chai367 bytes (47 words) - 10:38, 31 December 2015
- <strong>[[Houston Problem Book Problem 82|Problem 82]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[continuum]] of [[surjective semi-sp366 bytes (45 words) - 10:39, 31 December 2015
- <strong>[[Houston Problem Book Problem 83|Problem 83]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[connected]] [[metric space]].710 bytes (109 words) - 10:40, 31 December 2015
- <strong>[[Houston Problem Book Problem 84|Problem 84]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[confluent]] image of an [[arc-like]] [[continuum]362 bytes (43 words) - 10:41, 31 December 2015
- <strong>[[Houston Problem Book Problem 85|Problem 85]] ([[The Houston Problem Book|HPB]]):</strong> If $f$ is a [[confluent]] mapping of an [[acyclic]] (or [[450 bytes (57 words) - 10:42, 31 December 2015
- Return to the [[The Houston Problem Book|Houston Problem Book Main Page]]. {{:Houston Problem Book Problem 51}}<br />2 KB (263 words) - 03:53, 30 November 2018
- <strong>[[Houston Problem Book Problem 86|Problem 86]] ([[The Houston Problem Book|HPB]]):</strong> Do [[confluent]] maps of [[continuum|continua]] preserve [376 bytes (46 words) - 10:46, 31 December 2015
- <strong>[[Houston Problem Book Problem 87|Problem 87]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[regularly submetrizable]] [[Moore space]] [[com368 bytes (42 words) - 10:46, 31 December 2015
- <strong>[[Houston Problem Book Problem 88|Problem 88]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[homogeneous]] [[continuum]] [[bihomogeneous]]?382 bytes (42 words) - 10:47, 31 December 2015
- <strong>[[Houston Problem Book Problem 89|Problem 89]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[noncombinatorial triangulation]] of t382 bytes (45 words) - 10:48, 31 December 2015
- <strong>[[Houston Problem Book Problem 90|Problem 90]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[hereditarily equivalent]] [[continuum]] other387 bytes (47 words) - 10:49, 31 December 2015
- <strong>[[Houston Problem Book Problem 91|Problem 91]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily equivalent]] [[continuum|continua]] have365 bytes (42 words) - 10:50, 31 December 2015
- <strong>[[Houston Problem Book Problem 92|Problem 92]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[continuum]] with [[positive span]] such that576 bytes (75 words) - 10:51, 31 December 2015
- <strong>[[Houston Problem Book Problem 93|Problem 93]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[homogeneous]] [[tree-like]] [[continu440 bytes (56 words) - 10:52, 31 December 2015
- <strong>[[Houston Problem Book Problem 94|Problem 94]] ([[The Houston Problem Book|HPB]]):</strong> If $M$ is a [[plane continuum]] with no [[weak cut point]]507 bytes (65 words) - 10:53, 31 December 2015
- <strong>[[Houston Problem Book Problem 95|Problem 95]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[countable]] [[product]] of [[lambda-connected|$\l518 bytes (65 words) - 10:54, 31 December 2015
- <strong>[[Houston Problem Book Problem 96|Problem 96]] ([[The Houston Problem Book|HPB]]):</strong> Is the image under a [[local homeomorphism]] of a [[delta-423 bytes (51 words) - 10:55, 31 December 2015

## Page text matches

- ...tion on [[Problems]] such as a full transcription of [[The Houston Problem Book]], and follow our [https://twitter.com/hyperspacewiki Twitter]. | [[The Houston Problem Book]]2 KB (314 words) - 02:50, 24 December 2018
- [http://web.mst.edu/~ingram/hpb.pdf The Houston Problem Book] (pdf)<br /> [[The Houston Problem Book]] (wiki)3 KB (460 words) - 15:16, 23 December 2018
- <strong>[[Houston Problem Book Problem 6|Problem 6]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[chainable]] [[continuum]] be [[embed|e504 bytes (72 words) - 22:23, 30 December 2015
- ...''isomorphic'' to $G_2$, written $G_1 \cong G_2$.<ref>Pinter, Charles C. A Book of Abstract Algebra. Dover ed. Mineola, N.Y: Dover Publications, 2010.</ref757 bytes (102 words) - 06:13, 29 November 2018
- {{Book|Several Old and New Problems in Continuum Theory|2000|Topology Proceedings|542 bytes (65 words) - 15:27, 23 December 2018
- {{Book|A hereditarily indecomposable tree-like continuum without the fixed point p343 bytes (39 words) - 15:32, 23 December 2018
- ...e say that $H$ is a ''homomorphic image'' of $G$.<ref>Pinter, Charles C. A Book of Abstract Algebra. Dover ed. Mineola, N.Y: Dover Publications, 2010.</ref768 bytes (106 words) - 05:47, 29 November 2018
- ...ed the problems in the [http://web.mst.edu/~ingram/hpb.pdf Houston Problem Book] here.<ref>Cuchta, Tom. 2015. [http://tomcuchta.com/]</ref> | [[The Houston Problem Book Problems 1-50|The Houston Problem Book Problem Set]]1 KB (128 words) - 05:30, 30 November 2018
- {{Book|On hit-and-miss hyperspace topologies|1993|Commentationes Mathematicae Univ449 bytes (55 words) - 04:33, 21 December 2017
- {{Book|Hyperspaces, Fundamentals and Recent Advances|1999|Marcel Dekker||Alejandro [[Category:Book]]8 KB (903 words) - 04:32, 21 December 2017
- <strong>[[Houston Problem Book Problem 2|Problem 2]] ([[The Houston Problem Book|HPB]]): </strong> Suppose $X$ is a [[continuum]] such that for each positiv713 bytes (99 words) - 01:51, 26 November 2016
- <strong>[[Houston Problem Book Problem 1|Problem 1]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] which cannot be [[Embedding547 bytes (75 words) - 01:07, 27 June 2016
- <strong>[[Houston Problem Book Problem 19|Problem 19]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[strictly non-mutually aposyndetic]] [[continuu561 bytes (69 words) - 02:22, 31 December 2015
- <strong>[[Houston Problem Book Problem 17|Problem 17]] ([[The Houston Problem Book|HPB]]):</strong> Is there a [[topological space]] $(X,\tau)$ on which the [490 bytes (63 words) - 01:40, 31 December 2015
- <strong>[[Houston Problem Book Problem 15|Problem 15]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open mapping]] of a [[compact621 bytes (89 words) - 23:34, 30 December 2015
- <strong>[[Houston Problem Book Problem 13|Problem 13]] ([[The Houston Problem Book|HPB]]):</strong> Is the [[product]] of two [[strongly Hurewicz]] [[metric s398 bytes (49 words) - 22:58, 30 December 2015
- <strong>[[Houston Problem Book Problem 11|Problem 11]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[strongly Hurewicz]] space an [[absolute F sigma|483 bytes (64 words) - 22:49, 30 December 2015
- <strong>[[Houston Problem Book Problem 5|Problem 5]] ([[The Houston Problem Book|HPB]]):</strong> Can every [[hereditarily decomposable]] [[Chainable contin521 bytes (67 words) - 01:57, 26 November 2016
- <strong>[[Houston Problem Book Problem 4|Problem 4]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[Suslinean]] curve, does there exist a [[coun456 bytes (59 words) - 21:52, 30 December 2015
- <strong>[[Houston Problem Book Problem 3|Problem 3]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[continuum]] such that every [[subcontinuum]]491 bytes (65 words) - 22:24, 30 December 2015
- <strong>[[Houston Problem Book Problem 9|Problem 9]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[real curve]] which can be mapped [[Su605 bytes (81 words) - 04:32, 30 November 2018
- <strong>[[Houston Problem Book Problem 8|Problem 8]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a [[rational]] curve which topologically457 bytes (57 words) - 22:39, 30 December 2015
- <strong>[[Houston Problem Book Problem 7|Problem 7]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[rim-type]] of any [[real curve]] (or459 bytes (61 words) - 22:29, 30 December 2015
- [[Houston Problem Book Problem 7]]<br />185 bytes (28 words) - 22:32, 30 December 2015
- [[Houston Problem Book Problem 7]]<br />194 bytes (28 words) - 22:32, 30 December 2015
- [[Houston Problem Book Problem 7]]312 bytes (54 words) - 22:36, 30 December 2015
- [[Houston Problem Book Problem 9]]<br />189 bytes (26 words) - 22:43, 30 December 2015
- <strong>[[Houston Problem Book Problem 10|Problem 10]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $D$ is a [[dendroid]], $S$ is [[compact]], [[finit656 bytes (85 words) - 04:33, 30 November 2018
- [[Houston Problem Book Problem 10]]46 bytes (6 words) - 22:46, 30 December 2015
- [[Houston Problem Book Problem 11]]<br />483 bytes (85 words) - 22:55, 30 December 2015
- <strong>[[Houston Problem Book Problem 12|Problem 12]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[product]] of two [[Hurewicz]] [[metric space|met409 bytes (51 words) - 22:56, 30 December 2015
- <strong>[[Houston Problem Book Problem 14|Problem 14]] ([[The Houston Problem Book|HPB]]):</strong> Is every [[Lindelöf]] [[totally paracompact]] space [[Hur364 bytes (43 words) - 23:02, 30 December 2015
- * [[Houston Problem Book Problem 14]]460 bytes (59 words) - 07:05, 1 December 2018
- [[Houston Problem Book Problem 14]]<br />247 bytes (38 words) - 23:30, 30 December 2015
- [[Houston Problem Book Problem 15]]<br />287 bytes (35 words) - 23:37, 30 December 2015
- <strong>[[Houston Problem Book Problem 16|Problem 16]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[locally confluent]] and [[light]] mappi637 bytes (90 words) - 23:41, 30 December 2015
- [[Houston Problem Book Problem 16]]<br />320 bytes (53 words) - 00:52, 31 December 2015
- [[Houston Problem Book Problem 17]]<br />103 bytes (15 words) - 01:41, 31 December 2015
- <strong>[[Houston Problem Book Problem 18|Problem 18]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[open mapping]] of a [[continuum]] $522 bytes (71 words) - 02:17, 31 December 2015
- <strong>[[Houston Problem Book Problem 20|Problem 20]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is an [[open map|open]] [[continuous]] mapping825 bytes (131 words) - 02:54, 31 December 2015
- <strong>[[Houston Problem Book Problem 21|Problem 21]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is a [[planar]] [[continuum]] which has only a fini551 bytes (73 words) - 06:01, 31 December 2015
- <strong>[[Houston Problem Book Problem 22|Problem 22]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[contin447 bytes (57 words) - 06:03, 31 December 2015
- <strong>[[Houston Problem Book Problem 23|Problem 23]] ([[The Houston Problem Book|HPB]]):</strong> Does every totally non-[[semi-locally connected]] [[bicomp417 bytes (49 words) - 06:04, 31 December 2015
- <strong>[[Houston Problem Book Problem 24|Problem 24]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $X$ is a [[simple tree]] and the [[widt472 bytes (68 words) - 06:06, 31 December 2015
- <strong>[[Houston Problem Book Problem 25|Problem 25]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[tree-like]] [[continuum]], its [[width]567 bytes (87 words) - 06:08, 31 December 2015
- <strong>[[Houston Problem Book Problem 26|Problem 26]] ([[The Houston Problem Book|HPB]]):</strong> Let $M$ be a [[locally compact]] [[metric space]] and $a \737 bytes (113 words) - 06:10, 31 December 2015
- <strong>[[Houston Problem Book Problem 27|Problem 27]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $M$ is an $n$-[[dimension|dimensional]] [[compact]620 bytes (93 words) - 06:12, 31 December 2015
- <strong>[[Houston Problem Book Problem 28|Problem 28]] ([[The Houston Problem Book|HPB]]):</strong> Prove that the [[Topologist's sine curve]] is not [[pseudo395 bytes (46 words) - 06:14, 31 December 2015
- <strong>[[Houston Problem Book Problem 29|Problem 29]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a $1$-[[dimension|dimensional]] [[continu424 bytes (49 words) - 06:15, 31 December 2015
- <strong>[[Houston Problem Book Problem 30|Problem 30]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ and $Y$ are [[Continuum|continua]] (or even [[683 bytes (97 words) - 04:45, 30 November 2018
- <strong>[[Houston Problem Book Problem 31|Problem 31]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that the [[pseudo-arc]] is not [[pseudo-contrac366 bytes (43 words) - 06:18, 31 December 2015
- <strong>[[Houston Problem Book Problem 32|Problem 32]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a mapping $f$ of the [[circle]] or the [[609 bytes (85 words) - 06:59, 31 December 2015
- <strong>[[Houston Problem Book Problem 33|Problem 33]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $P$ is a subset of the positive integers with the688 bytes (104 words) - 04:42, 30 November 2018
- <strong>[[Houston Problem Book Problem 34|Problem 34]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $f$ is a [[Function|mapping]] of a [[tr519 bytes (72 words) - 04:47, 30 November 2018
- <strong>[[Houston Problem Book Problem 35|Problem 35]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[Continuum|c715 bytes (107 words) - 04:49, 30 November 2018
- <strong>[[Houston Problem Book Problem 36|Problem 36]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] and [[locally conflu575 bytes (81 words) - 07:05, 31 December 2015
- <strong>[[Houston Problem Book Problem 37|Problem 37]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $(X, \leq)$ is a finite [[Partially Ordered Set|pa904 bytes (137 words) - 04:55, 30 November 2018
- ...The Houston Problem Book|HPB]]):</strong> Suppose $X$ in [[Houston Problem Book Problem 37|HPB Problem 37]] is $A \cup B$, where $A$ and $B$ are [[closed]]506 bytes (72 words) - 08:11, 31 December 2015
- <strong>[[Houston Problem Book Problem 39|Problem 39]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a finite [[partially ordered set]] with the403 bytes (51 words) - 08:12, 31 December 2015
- <strong>[[Houston Problem Book Problem 40|Problem 40]] ([[The Houston Problem Book|HPB]]):</strong> Does there exist a nonseparating ([[locally compact]]) sub565 bytes (76 words) - 08:13, 31 December 2015
- <strong>[[Houston Problem Book Problem 41|Problem 41]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that the [[plane]] is the union of two [[disjoint]530 bytes (73 words) - 09:35, 31 December 2015
- <strong>[[Houston Problem Book Problem 42|Problem 42]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[compact]] [[metric space]] and $S$ is t609 bytes (93 words) - 09:37, 31 December 2015
- <strong>[[Houston Problem Book Problem 43|Problem 43]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a curve that is [[contractible]], or [[pseu524 bytes (66 words) - 09:39, 31 December 2015
- <strong>[[Houston Problem Book Problem 44|Problem 44]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[metric space]]; does [[superstable]] in372 bytes (46 words) - 09:40, 31 December 2015
- <strong>[[Houston Problem Book Problem 45|Problem 45]] ([[The Houston Problem Book|HPB]]):</strong> It is true that if $Y$ is an [[arcwise connected]] [[conti567 bytes (75 words) - 09:43, 31 December 2015
- <strong>[[Houston Problem Book Problem 46|Problem 46]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $Y$ is a [[compact]] [[metric space]] such that th497 bytes (66 words) - 09:44, 31 December 2015
- <strong>[[Houston Problem Book Problem 47|Problem 47]] ([[The Houston Problem Book|HPB]]):</strong> Do [[atomic mapping|atomic mappings]] preserve [[semi-apos513 bytes (61 words) - 09:46, 31 December 2015
- <strong>[[Houston Problem Book Problem 48|Problem 48]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[unicoherent]] and [[mutually aposyndetic]] [[con481 bytes (58 words) - 09:48, 31 December 2015
- <strong>[[Houston Problem Book Problem 49|Problem 49]] ([[The Houston Problem Book|HPB]]):</strong> Supppose $f$ is an [[open map|open mapping]] of a [[contin532 bytes (79 words) - 09:50, 31 December 2015
- <strong>[[Houston Problem Book Problem 50|Problem 50]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[weakly confluent]] mapping of a [[conti493 bytes (70 words) - 09:51, 31 December 2015
- <strong>[[Houston Problem Book Problem 51|Problem 51]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[polyhedron]] is a the [[weakly conf419 bytes (53 words) - 09:54, 31 December 2015
- <strong>[[Houston Problem Book Problem 52|Problem 52]] ([[The Houston Problem Book|HPB]]):</strong> Are [[strongly regular]] curves [[inverse limit|inverse li481 bytes (58 words) - 09:55, 31 December 2015
- <strong>[[Houston Problem Book Problem 53|Problem 53]] ([[The Houston Problem Book|HPB]]):</strong> If $X$ is the [[inverse limit]] of [[connected]] [[graph|g515 bytes (65 words) - 09:56, 31 December 2015
- <strong>[[Houston Problem Book Problem 54|Problem 54]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that $X$ is the [[inverse limit]] of [[connecte554 bytes (75 words) - 09:57, 31 December 2015
- <strong>[[Houston Problem Book Problem 55|Problem 55]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[continuous]] mapping of a [[continuum]] [[onto424 bytes (52 words) - 09:59, 31 December 2015
- <strong>[[Houston Problem Book Problem 56|Problem 56]] ([[The Houston Problem Book|HPB]]):</strong> Does each [[weakly confluent]] mapping of a [[continuum]]433 bytes (53 words) - 10:00, 31 December 2015
- <strong>[[Houston Problem Book Problem 57|Problem 57]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that each [[uniformly pathwise connected]] [[co403 bytes (47 words) - 10:01, 31 December 2015
- <strong>[[Houston Problem Book Problem 58|Problem 58]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $f$ is a [[continuous]] mapping of a [[chainable c578 bytes (80 words) - 10:03, 31 December 2015
- <strong>[[Houston Problem Book Problem 59|Problem 59]] ([[The Houston Problem Book|HPB]]):</strong> Does a [[continuum]] with zero [[surjective span]] have [[356 bytes (43 words) - 10:04, 31 December 2015
- <strong>[[Houston Problem Book Problem 60|Problem 60]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that if $Y=G_1 \cup G_2$ where $G_1$ and $G_2$516 bytes (73 words) - 10:06, 31 December 2015
- <strong>[[Houston Problem Book Problem 61|Problem 61]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $\mathcal{E}$ is the class of all finite one point861 bytes (129 words) - 10:11, 31 December 2015
- <strong>[[Houston Problem Book Problem 62|Problem 62]] ([[The Houston Problem Book|HPB]]):</strong> Are all [[shape|shapes]] of [[polyhedra]] [[stable]]? (Ask347 bytes (41 words) - 10:12, 31 December 2015
- <strong>[[Houston Problem Book Problem 63|Problem 63]] ([[The Houston Problem Book|HPB]]):</strong> Given a [[polyhedron]] $P$, does there exist a polyhedron406 bytes (53 words) - 10:13, 31 December 2015
- <strong>[[Houston Problem Book Problem 64|Problem 64]] ([[The Houston Problem Book|HPB]]):</strong> Is each [[uniformly path-connected]] [[continuum]] [[g-con379 bytes (42 words) - 10:14, 31 December 2015
- <strong>[[Houston Problem Book Problem 65|Problem 65]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[uniformly path-connected]] [[c537 bytes (74 words) - 10:15, 31 December 2015
- <strong>[[Houston Problem Book Problem 66|Problem 66]] ([[The Houston Problem Book|HPB]]):</strong> If $C$ is a [[connected]] [[Borel set|Borel subset]] of a503 bytes (65 words) - 10:16, 31 December 2015
- <strong>[[Houston Problem Book Problem 67|Problem 67]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that, if $C$ is a [[su606 bytes (84 words) - 10:18, 31 December 2015
- <strong>[[Houston Problem Book Problem 68|Problem 68]] ([[The Houston Problem Book|HPB]]):</strong> If for each [[subcontinuum]] $C$ of the [[continuum]] $X$,508 bytes (67 words) - 10:19, 31 December 2015
- <strong>[[Houston Problem Book Problem 69|Problem 69]] ([[The Houston Problem Book|HPB]]):</strong> Do [[hereditarily indecomposable]] [[tree-like]] [[continu402 bytes (45 words) - 10:20, 31 December 2015
- <strong>[[Houston Problem Book Problem 70|Problem 70]] ([[The Houston Problem Book|HPB]]):</strong> Do [[uniquely lambda-connected|uniquely $\lambda$-connecte505 bytes (55 words) - 10:21, 31 December 2015
- <strong>[[Houston Problem Book Problem 71|Problem 71]] ([[The Houston Problem Book|HPB]]):</strong> Suppose that $X$ is a [[continuum]] such that, if $\epsilo754 bytes (108 words) - 10:24, 31 December 2015
- <strong>[[Houston Problem Book Problem 72|Problem 72]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn443 bytes (53 words) - 10:25, 31 December 2015
- <strong>[[Houston Problem Book Problem 73|Problem 73]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[continuum]] such that each [[sigma-conn474 bytes (58 words) - 10:26, 31 December 2015
- <strong>[[Houston Problem Book Problem 74|Problem 74]] ([[The Houston Problem Book|HPB]]):</strong> Let $f$ be a [[perfect]] [[pseudo-confluent]] mapping of a702 bytes (85 words) - 10:29, 31 December 2015
- <strong>[[Houston Problem Book Problem 75|Problem 75]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] which poss617 bytes (85 words) - 10:30, 31 December 2015
- <strong>[[Houston Problem Book Problem 76|Problem 76]] ([[The Houston Problem Book|HPB]]):</strong> Suppose $X$ is a [[separable]] [[metric space]] such that,535 bytes (82 words) - 10:31, 31 December 2015
- <strong>[[Houston Problem Book Problem 77|Problem 77]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[continuum]] $X$ is [[regular]] if and459 bytes (62 words) - 10:32, 31 December 2015
- <strong>[[Houston Problem Book Problem 78|Problem 78]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that, for each [[decomposition]] of a [[finitel521 bytes (65 words) - 10:34, 31 December 2015
- <strong>[[Houston Problem Book Problem 79|Problem 79]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that no [[biconnected]] set with a [[dispersion423 bytes (53 words) - 10:35, 31 December 2015
- <strong>[[Houston Problem Book Problem 80|Problem 80]] ([[The Houston Problem Book|HPB]]):</strong> Is it true that a [[separable]] [[metric space]] is [[embe543 bytes (70 words) - 10:36, 31 December 2015