-
Princeton University.
Among Munkres'
contributions to
mathematics is the
development of what is
sometimes called the
Munkres ****ignment algorithm. A significant...
- polynomial.
Since then the
algorithm has been
known also as the Kuhn–
Munkres algorithm or
Munkres ****ignment algorithm. The time
complexity of the
original algorithm...
- open and closed, and
therefore clopen. As
described by
topologist James Munkres,
unlike a door, "a set can be open, or closed, or both, or neither!" emphasizing...
- "Error in the
statement of Thm. 2-13 in
Calculus on Manifolds".
Munkres (1991)
Munkres (1991, p. vii)
Spivak (1999) Auslander,
Louis (1967), "Review of...
- 31 See
Munkres 2000, p. 19 See p.388 of Lee, John M. (2010).
Introduction to
Topological Manifolds, 2nd Ed.
Kelley 1985, p. 85 See
Munkres 2000, p. 21...
- space,
every σ-locally
finite collection of sets is countable.
Munkres 2000, p. 244.
Munkres 2000, p. 245
Lemma 39.1.
Engelking 1989,
Theorem 1.1.13. Engelking...
- a
perfectly normal space equivalent?". Engelking,
Theorem 2.1.6, p. 68
Munkres 2000, p. 213
Willard 1970, pp. 100–101. "separation
axioms in nLab". ncatlab...
-
section 2.2.
Armstrong 1983,
definition 2.1.
Armstrong 1983,
theorem 2.6.
Munkres,
James R (2015). Topology. Pearson. pp. 317–319. ISBN 978-93-325-4953-1...
-
significance in topology, geometry, and
adjacent areas of mathematics.
Munkres,
James R. (2000).
Topology (2nd ed.).
Upper Saddle River, NJ: Prentice...
- Applications. CRC Press. pp. 3–4. ISBN 9781420089745.
Munkres 2000, pp. 88.
Munkres 2000, pp. 95.
Munkres 2000, pp. 102. Hart 2004, p. 9. Hart 2004, pp. 8–9...
