Nielsen realization problem

Nielsen realization problem

The Nielsen realization problem is a question asked by Jakob Nielsen (1932, p. 147–148) about whether finite subgroups of mapping class groups can act on surfaces, that was answered positively by Steven Kerckhoff (1980, 1983).

Statement

Given an oriented surface, we can divide group Diff(S) the diffeomorphisms of the surface to itself in isotopy classes to get the mapping class group π0(Diff(S)). The conjecture asks whether a finite group of the mapping class group of a surface can be realized as the isometry group of a hyperbolic metric on the surface.

The mapping class group acts on Teichmüller space. An equivalent way of stating the question asks whether every finite subgroup of the mapping class group fixes some point of Teichmüller space.

History

Jakob Nielsen (1932, p. 147–148) asked whether finite subgroups of mapping class groups can act on surfaces. Kravetz (1959) claimed to solve the Nielsen realization problem but his proof depended on trying to show that Teichmüller space (with the Teichmüller metric) is negatively curved. Linch (1971) pointed out a gap in the argument, and in Masur (1975) showed that Teichmüller space is not negatively curved. Steven Kerckhoff (1980, 1983) gave a correct proof that finite subgroups of mapping class groups can act on surfaces using left earthquakes.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • List of mathematics articles (N) — NOTOC N N body problem N category N category number N connected space N dimensional sequential move puzzles N dimensional space N huge cardinal N jet N Mahlo cardinal N monoid N player game N set N skeleton N sphere N! conjecture Nabla symbol… …   Wikipedia

  • Steven Kerckhoff — Steven Paul Kerckhoff (born 1952) is a professor of mathematics at Stanford University, who works on hyperbolic 3 manifolds and Teichmüller spaces. He received his Ph.D. in mathematics from Princeton University in 1978, under the direction of… …   Wikipedia

  • literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… …   Universalium

  • performing arts — arts or skills that require public performance, as acting, singing, or dancing. [1945 50] * * * ▪ 2009 Introduction Music Classical.       The last vestiges of the Cold War seemed to thaw for a moment on Feb. 26, 2008, when the unfamiliar strains …   Universalium

  • String theory — This article is about the branch of theoretical physics. For other uses, see String theory (disambiguation). String theory …   Wikipedia

  • System identification — In control engineering, the field of system identification uses statistical methods to build mathematical models of dynamical systems from measured data. System identification also includes the optimal design of experiments for efficiently… …   Wikipedia

  • Superlens — A superlens, super lens or perfect lens is a lens which uses metamaterials to go beyond the diffraction limit. The diffraction limit is an inherent limitation in conventional optical devices or lenses.[1] In 2000, a type of lens was proposed,… …   Wikipedia

  • Quantencomputer — Ein Quantencomputer bzw. Quantenrechner ist ein Computer, dessen Funktion auf den besonderen Gesetzen der Quantenmechanik beruht. Im Unterschied zum Digitalrechner arbeitet er nicht auf der Basis der Gesetze der klassischen Physik bzw. Informatik …   Deutsch Wikipedia

  • Italy — /it l ee/, n. a republic in S Europe, comprising a peninsula S of the Alps, and Sicily, Sardinia, Elba, and other smaller islands: a kingdom 1870 1946. 57,534,088; 116,294 sq. mi. (301,200 sq. km). Cap.: Rome. Italian, Italia. * * * Italy… …   Universalium

  • Shor's algorithm — Shor s algorithm, first introduced by mathematician Peter Shor, is a quantum algorithm for integer factorization. On a quantum computer, to factor an integer N, Shor s algorithm takes polynomial time in log{N}, specifically O((log{N})^3),… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”