List of mathematical concepts named after places

Short description: Wikipedia list article

This list contains mathematical concepts named after geographic locations.

• Anarboricity, a number assigned to finite graphs, defined as the size of the largest partition of the graph into edge-disjoint subgraphs, each containing at least one cycle (graph theory). It is named in honor of the city of Ann Arbor by Frank Harary.
• Arctic circle theorem describing the boundary of domino tilings
• Atlantic City algorithm
• Babylonian square root method, an iterative numerical method for improving an approximation to the square root of a positive number. It is so called because its earliest known use was in ancient Babylonia.
• Basel problem
• Byzantine generals problem
• Cairo pentagonal tiling
• Canadian traveller problem
• Chinese postman problem
• Chinese remainder theorem, a theorem in number theory concerning solutions of systems of linear Diophantine equations, in the present day usually stated in the language of modular arithmetic. It is so called because it was discovered in China in the 3rd century AD.
• Chinese restaurant process, a stochastic process with applications in population genetics. It is so called because of an analogy to the custom of table-sharing in Chinese restaurants.
• Complex Mexican hat wavelet
• Delian problem
• Egyptian fraction, a way of representing a positive rational number as a sum of distinct (i.e. no two the same) reciprocals of positive integers. These were a part of a numeral system used in ancient Egypt.
• Egyptian multiplication
• Erlangen program, the program for future research in mathematics proposed by Felix Klein in 1872 while he was at the University of Erlangen in Germany.
• French railroad metric
• Hawaiian earring, a topological space homeomorphic to the one-point compactification of the union of a countably infinite family of open intervals. It is so called because of the appearance of a picture of the space, showing an infinite sequence of circles mutually tangent at a common point.
• Hungarian algorithm
• Indian numerals
• Irish logarithm
• Japanese ring
• Japanese theorem for cyclic polygons, a geometric theorem found in a Shinto shrine during Japan's Edo period
• Las Vegas algorithm
• Ljubljana graph
• Manhattan distance
• Mexican hat wavelet
• Monte Carlo method, any of many methods of simulation involving pseudo-randomness. The name alludes to the randomness of gambling casinos for which Monte Carlo is famous.
• Nauru graph
• Nottingham group
• Oberwolfach problem
• Paris metric
• Paxos algorithm
• Polish notation
• Polish space (in topology)
• Roman surface, a self-intersecting mapping of the real projective plane into three-dimensional space, with an unusually high degree of symmetry. It is so called because Jakob Steiner was in Rome when he thought of it.
• Russian peasant multiplication
• St. Petersburg paradox
• Scottish Book
• Seven bridges of Königsberg, a famous problem in what would become graph theory, originally phrased as the problem of finding a way to walk across all of Königsberg's seven bridges and return to one's starting point without walking across any bridge more than once.
• Swiss cheese
• Syracuse problem
• Toronto space
• Tower of Hanoi
• Tropical geometry, algebraic geometry with addition in place of multiplication and the min operator in place of addition. It is so called because it was developed by Brazil ian mathematicians.
• Warsaw circle
• Woods Hole formula, a fixed-point theorem discussed at a meeting in 1964 in Woods Hole, Massachusetts